Difference between revisions of "10-601 GM1"
From Cohen Courses
Jump to navigationJump to searchLine 1: | Line 1: | ||
+ | |||
+ | This a lecture used in the [[Syllabus for Machine Learning 10-601 in Fall 2014]] | ||
=== Slides === | === Slides === |
Revision as of 09:34, 12 August 2014
This a lecture used in the Syllabus for Machine Learning 10-601 in Fall 2014
Slides
Readings
- Chap 8.1 and 8.2.2 (Bishop)
- Graphical Models by Michael I. Jordan
Taking home message
- factorization theorem of BN
- Full, independent and intermediate conditional probability models
- Markov blanket
- Learning a BN
- Inference in BN is NP hard
- Approximate inference in BN