120 likes | 253 Views
Representation. Probabilistic Graphical Models. Bayesian Networks. Factorization & Independence. Dual View. Independence Assumptions in G. The independencies implied by G I(G) =. G and P. We say that G is an I-map (independence map) of P if. I-maps. P 2. P 1.
E N D
Representation Probabilistic Graphical Models Bayesian Networks Factorization & Independence
Independence Assumptions in G • The independencies implied by G I(G) =
G and P We say that G is an I-map (independence map) of P if
I-maps P2 P1
Factorization Independence Theorem: If P factorizes over G then G is an I-map for P D I G S L
Independence Factorization Theorem: If G is an I-map for P then P factorizes over G D I G S L
D I G S L
Summary • d-separation allows us to use G to read off independencies that must hold in any distribution P that factorizes over G • If the d-separation independencies hold in P, it must be representable as a BN over G