1 / 6

Markov Networks

Representation. Probabilistic Graphical Models. Independencies. Markov Networks. Separation in MNs. Definition: X and Y are separated in H given Z if there is no active trail in H between X and Y given Z. A. F. D. B. C. E. Factorization  Independence: MNS.

lucas-barnett
Download Presentation

Markov Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Representation Probabilistic Graphical Models Independencies MarkovNetworks

  2. Separation in MNs Definition: X and Y are separated in H given Z if there is no active trail in H between X and Y given Z A F D B C E

  3. Factorization  Independence: MNS Theorem: If P factorizes over H, and sepH(X, Y | Z) then P satisfies (X  Y | Z) A F D B C E

  4. Factorization  Independence: MNs If P satisfies I(H), we say that H is an I-map (independency map) of P Theorem: If P factorizes over H, then H is an I-map of P I(H) = {(X  Y | Z) : sepH(X, Y | Z)}

  5. Independence  Factorization • Theorem (Hammersley Clifford): For a positive distribution P, if H is an I-map for P, then P factorizes over H

  6. Summary Two equivalent* views of graph structure: • Factorization: H allows P to be represented • I-map: Independencies encoded by H hold in P If P factorizes over a graph H, we can read from the graph independencies that must hold in P (an independency map) * for positive distributions

More Related