Factor Graphs 2 - Conditional Independence | Stanford CS221: AI (Autumn 2019)

For more information about Stanford’s Artificial Intelligence professional and graduate programs, visit: https://stanford.io/3BklVrc

Topics: Beam search, local search, conditional independence, variable elimination
Reid Pryzant, PhD Candidate & Head Course Assistant
http://onlinehub.stanford.edu/

To follow along with the course schedule and syllabus, visit:
https://stanford-cs221.github.io/autu...

0:00 Introduction
0:34 Review: definition
1:39 Factor graph (example)
7:01 Review: backtracking search
8:42 Example: object tracking
8:59 Modeling object tracking
11:58 [Background] [Documentation] // Object tracking example
22:06 Beam search properties
36:12 Motivation
38:47 Non-independence
44:22 Conditioning: example
48:13 Markov blanket
50:20 Using conditional independence
57:04 Conditioning versus elimination