This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Probablistic Graphical Models, Spring 2007 Homework 2 Due at the beginning of class on 10/17/07 Instructions There are six questions in this homework. The last question involves some programming which should be done in MATLAB. Do not attach your code to the writeup. Make a tarball of your code and output, name it < userid > .tgz where your userid is your CS or Andrew id, and copy it to /afs/cs/academic/class/10708- f07/hw2/ < userid > . If you are not submitting this from an SCS machine, you might need to authenticate yourself first. See http://www.cs.cmu.edu/ ∼ help/afs/cross realm.html for instructions. If you are not a CMU student and don’t have a CS or Andrew id, email your submission to [email protected] You are allowed to use any of (and only) the material distributed in class for the homeworks. This includes the slides and the handouts given in the class 1 . Refer to the web page for policies regarding collaboration, due dates, and extensions. 1 [20 pts] Markov Networks We define the following properties for a set of conditional independencies • Strong Union: ( X ⊥ Y | Z ) ⇒ ( X ⊥ Y | Z,W ) In other words, additional evidence cannot induce dependence....
View Full Document
This note was uploaded on 05/25/2008 for the course MACHINE LE 10708 taught by Professor Carlosgustin during the Fall '07 term at Carnegie Mellon.
- Fall '07