Difference between revisions of "10-601 GM2"
From Cohen Courses
Jump to navigationJump to search| Line 6: | Line 6: | ||
=== Readings === | === Readings === | ||
| − | * | + | * See previous lecture |
| − | + | ||
| − | |||
=== To remember === | === To remember === | ||
Revision as of 17:20, 22 March 2016
Slides
Readings
- See previous lecture
To remember
- what is inference in DGMs
- the general outline of the BP algorithm for polytrees
- what is a polytree and when is BP exact
- what "message passing" means
- what a Markov blanket is
- what a Markov network (undirected model) is
- how node can be merged to create a polytree
- the advantages and disadvantages of BP on polytrees and loopy BP
