Difference between revisions of "10-601 GM1"

From Cohen Courses
Jump to navigationJump to search
 
(7 intermediate revisions by the same user not shown)
Line 1: Line 1:
  
This a lecture used in the [[Syllabus for Machine Learning 10-601 in Fall 2014]]
+
This a lecture used in the [[Syllabus for Machine Learning 10-601B in Spring 2016]]
  
 
=== Slides ===
 
=== Slides ===
  
* Ziv's lecture: [http://www.cs.cmu.edu/~zivbj/classF14/BNs.pdf Slides in pdf].
+
* [http://www.cs.cmu.edu/~wcohen/10-601/networks-1.pdf Slides in pdf], [http://www.cs.cmu.edu/~wcohen/10-601/networks-1.pptx Slides in PPT].
  
 
=== Readings ===
 
=== Readings ===
* Chap 8.1 and 8.2.2 (Bishop)
 
* [http://curtis.ml.cmu.edu/w/courses/images/8/89/GM-jordan.pdf Graphical Models by Michael I. Jordan]
 
  
=== Taking home message ===
+
* Chapter 6.11 Mitchell
 +
* Chapter 10 Murphy
  
* factorization theorem of BN
+
* Or: Chap 8.1 and 8.2.2 (Bishop)
* Full, independent and intermediate conditional probability models
+
* Or: Chap 15 (Russell and Norvig) - disclaimer, my edition is old!
* Markov blanket
+
 
* Learning a BN
+
=== To remember ===
* Inference in BN is NP hard
+
 
* Approximate inference in BN
+
* Conditional independence and dependence
 +
** Notations for these
 +
* Semantics of a directed graphical model (aka Bayesian network, belief network)
 +
** Converting a joint probability distribution + conditional independencies to a network
 +
** Converting a network to a joint PDF
 +
* Determining conditional independencies from the structure of a network
 +
** Blocking
 +
** d-separation

Latest revision as of 17:22, 22 March 2016

This a lecture used in the Syllabus for Machine Learning 10-601B in Spring 2016

Slides

Readings

  • Chapter 6.11 Mitchell
  • Chapter 10 Murphy
  • Or: Chap 8.1 and 8.2.2 (Bishop)
  • Or: Chap 15 (Russell and Norvig) - disclaimer, my edition is old!

To remember

  • Conditional independence and dependence
    • Notations for these
  • Semantics of a directed graphical model (aka Bayesian network, belief network)
    • Converting a joint probability distribution + conditional independencies to a network
    • Converting a network to a joint PDF
  • Determining conditional independencies from the structure of a network
    • Blocking
    • d-separation