Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of...
-
date post
19-Dec-2015 -
Category
Documents
-
view
215 -
download
1
Transcript of Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of...
![Page 1: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/1.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 1
University of WashingtonDepartment of Electrical Engineering
EE512 Spring, 2006 Graphical Models
Jeff A. Bilmes <[email protected]>Jeff A. Bilmes <[email protected]>
Lecture 5 Slides
April 11th, 2006
![Page 2: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/2.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 2
• Chordal graph theory• Elimination and chordality• Recognizing chordal graphs• How to triangulate a graph (heuristics)• Properties of conditional independence• Markov properties on graphs
Outline of Today’s Lecture
![Page 3: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/3.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 3
Books and Sources for Today
• Jordan: Chapters 17.• Lauritzen, 1986. Chapters 1-3.• Any good graph theory text.
![Page 4: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/4.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 4
• L1: Tues, 3/28: Overview, GMs, Intro BNs.• L2: Thur, 3/30: semantics of BNs + UGMs• L3: Tues, 4/4: elimination, probs, chordal I• L4: Thur, 4/6: chrdal, sep, decomp, elim• L5: Tue, 4/11: chdl/elim, mcs, triang, ci props.• L6: Thur, 4/13• L7: Tues, 4/18• L8: Thur, 4/20• L9: Tue, 4/25• L10: Thur, 4/27
• L11: Tues, 5/2• L12: Thur, 5/4• L13: Tues, 5/9• L14: Thur, 5/11• L15: Tue, 5/16• L16: Thur, 5/18• L17: Tues, 5/23• L18: Thur, 5/25• L19: Tue, 5/30• L20: Thur, 6/1: final presentations
Class Road Map
![Page 5: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/5.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 5
• If you see a typo, please tell me during lecture– everyone will then benefit.– note, corrected slides will go on web.
• READING: Chapter 3 & 17 in Jordan’s book• Lauritzen chapters 1-3 (on reserve in library)• Check out CSE590AI this week (Weds, CSE609, 3:30-4:20)
– Compiling Relational Bayesian Networks for Exact Inference, by Mark Chavira, Adnan Darwiche, and Manfred Jaeger
– This is a “search” based method for inference of relational models, that pre-compiles such graph into logic equations. It has an implicit value-specific junction tree in it. We will be covering search based methods for inference in the upcoming weeks discussing what conditions are requried for them to help.
• Reminder: TA discussions and office hours:– Office hours: Thursdays 3:30-4:30, Sieg Ground Floor Tutorial
Center– Discussion Sections: Fridays 9:30-10:30, Sieg Ground Floor
Tutorial Center Lecture Room
Announcements
![Page 6: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/6.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 6
Summary of Last Time
![Page 7: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/7.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 7
Examples: decomposition tree and factorization
![Page 8: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/8.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 8
Graph, decomposition tree, and junction tree
![Page 9: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/9.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 9
How can we tell if G is chordal?
CompleteSet
![Page 10: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/10.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 10
How can we tell if G is chordal?
![Page 11: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/11.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 11
How can we tell if G is chordal?
![Page 12: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/12.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 12
How can we tell if G is chordal?
![Page 13: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/13.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 13
How can we recognize chordal graphs?
![Page 14: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/14.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 14
Maximum Cardinality Search (MCS)
![Page 15: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/15.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 15
Maximum Cardinality Search (MCS)
![Page 16: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/16.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 16
How can we recognize chordal graphs?
1 2
3 41
2
3
4
5
6
78
9
10
11
![Page 17: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/17.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 17
How can we recognize chordal graphs?
![Page 18: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/18.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 18
MCS with Junction Tree
B
A
C
D
E F G
H I9 8
7 6
3
5
4
2
1
r.i.p. order:
![Page 19: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/19.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 19
Elimination and Bayesian Networks
![Page 20: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/20.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 20
Triangulation Heuristics
![Page 21: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/21.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 21
Triangulation Heuristics
![Page 22: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/22.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 22
Are all trees of maxcliques JTs?
![Page 23: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/23.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 23
Are all trees of maxcliques JTs?
![Page 24: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/24.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 24
Are all trees of maxcliques JTs?
![Page 25: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/25.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 25
Are all trees of maxcliques JTs?
![Page 26: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/26.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 26
Junction Trees -> Factorization
![Page 27: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/27.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 27
Properties of Conditional Independence
![Page 28: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/28.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 28
Properties of Conditional Independence
![Page 29: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/29.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 29
Properties of Conditional Independence
![Page 30: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/30.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 30
Properties of Conditional Independence
![Page 31: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/31.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 31
Properties of Conditional Independence
![Page 32: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/32.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 32
Properties of Conditional Independence
![Page 33: Lec 5: April 11th, 2006EE512 - Graphical Models - J. BilmesPage 1 Jeff A. Bilmes University of Washington Department of Electrical Engineering EE512 Spring,](https://reader035.fdocuments.in/reader035/viewer/2022062516/56649d365503460f94a0e946/html5/thumbnails/33.jpg)
Lec 5: April 11th, 2006 EE512 - Graphical Models - J. Bilmes Page 33
Markov Properties of Graphs