10-601 GM1

From Cohen Courses
Revision as of 10:10, 21 March 2016 by Wcohen (talk | contribs) (→‎Slides)
Jump to navigationJump to search

This a lecture used in the Syllabus for Machine Learning 10-601 in Fall 2014

Slides

Readings

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