1 / 12

Semantics & Factorization

Representation. Probabilistic Graphical Models. Bayesian Networks. Semantics & Factorization. P(G,D,I,S,L). G rade Course D ifficulty Student I ntelligence Student S AT Reference L etter. Difficulty. Intelligence. Grade. SAT. Letter. d 0. d 1. i 0. i 1. 0.6. 0.4. 0.7.

Download Presentation

Semantics & Factorization

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 Bayesian Networks Semantics & Factorization

  2. P(G,D,I,S,L) • Grade • Course Difficulty • Student Intelligence • Student SAT • Reference Letter

  3. Difficulty Intelligence Grade SAT Letter

  4. d0 d1 i0 i1 0.6 0.4 0.7 0.3 g1(A) g2(B) g3(C) i0,d0 0.3 0.4 0.3 i0,d1 0.05 0.25 0.7 s0 s1 i1,d0 0.9 0.08 0.02 i0 0.95 0.05 i1,d1 0.5 0.3 0.2 i1 0.2 0.8 l0 l1 g1 0.1 0.9 g2 0.4 0.6 g3 0.99 0.01 Difficulty Intelligence Grade SAT Letter

  5. Chain Rule for Bayesian Networks P(D) Difficulty Intelligence P(I) Grade SAT P(G|I,D) P(S|I) Letter P(L|G) P(D,I,G,S,L) = P(D) P(I) P(G|I,D) P(S|I) P(L|G) Distribution defined as a product of factors!

  6. d0 d1 i0 i1 0.6 0.4 0.7 0.3 g1 g2 g3 i0,d0 0.3 0.4 0.3 i0,d1 0.05 0.25 0.7 s0 s1 i1,d0 0.9 0.08 0.02 i0 0.95 0.05 i1,d1 0.5 0.3 0.2 i1 0.2 0.8 l0 l1 g1 0.1 0.9 g2 0.4 0.6 g3 0.99 0.01 Difficulty Intelligence Grade SAT Letter P(d0, i1, g3, s1, l1) =

  7. Bayesian Network • A Bayesian network is: • A directed acyclic graph (DAG) G whose nodes represent the random variables X1,…,Xn • For each node Xi a CPD P(Xi | ParG(Xi)) • The BN represents a joint distribution via the chain rule for Bayesian networks P(X1,…,Xn) = i P(Xi | ParG(Xi))

  8. BN Is a Legal Distribution: P ≥ 0

  9. BN Is a Legal Distribution: ∑ P = 1 ∑D,I,G,S,L P(D,I,G,S,L) = ∑D,I,G,S,L P(D) P(I) P(G|I,D) P(S|I) P(L|G) = ∑D,I,G,S P(D) P(I) P(G|I,D) P(S|I) ∑L P(L|G) = ∑D,I,G,S P(D) P(I) P(G|I,D) P(S|I) = ∑D,I,G P(D) P(I) P(G|I,D) ∑S P(S|I) = ∑D,I P(D) P(I) ∑G P(G|I,D)

  10. P Factorizes over G • Let G be a graph over X1,…,Xn. • P factorizes over G if P(X1,…,Xn) = i P(Xi | ParG(Xi))

  11. Genetic Inheritance Jackie Clancy Marge Selma Homer Genotype Lisa Maggie Bart AA, AB, AO, BO, BB, OO Phenotype A, B, AB, O

  12. BNs for Genetic Inheritance GClancy GJackie BJackie BClancy GHomer GMarge GSelma BMarge BSelma BHomer GLisa GMaggie GBart BLisa BMaggie BBart

More Related