Junction Tree Construction
description
Transcript of Junction Tree Construction
![Page 1: Junction Tree Construction](https://reader035.fdocuments.net/reader035/viewer/2022062323/5681610f550346895dd067bd/html5/thumbnails/1.jpg)
JUNCTION TREE CONSTRUCTIONPractice exercise
![Page 2: Junction Tree Construction](https://reader035.fdocuments.net/reader035/viewer/2022062323/5681610f550346895dd067bd/html5/thumbnails/2.jpg)
2
Example 1: Junction Tree Construction
A B
D C
GHF
E
Step1: Insert link between parents of common child
![Page 3: Junction Tree Construction](https://reader035.fdocuments.net/reader035/viewer/2022062323/5681610f550346895dd067bd/html5/thumbnails/3.jpg)
3
Example 1: Junction Tree Construction
A B
D C
GHF
E
Step2: Convert into undirected graph
A B
D C
GHF
E
![Page 4: Junction Tree Construction](https://reader035.fdocuments.net/reader035/viewer/2022062323/5681610f550346895dd067bd/html5/thumbnails/4.jpg)
4
Example 1: Junction Tree Construction
A B
D C
GHF
E
Step3: Triangulate a graph if it has circle of length>3
Note : No need of triangulation in this example.
![Page 5: Junction Tree Construction](https://reader035.fdocuments.net/reader035/viewer/2022062323/5681610f550346895dd067bd/html5/thumbnails/5.jpg)
5
Example 1: Junction Tree Construction
Step3: Numbered the node if its numbered neighboured nodes are connected together.
A B
D C
GHF
E
1 2
3 45
6 78
![Page 6: Junction Tree Construction](https://reader035.fdocuments.net/reader035/viewer/2022062323/5681610f550346895dd067bd/html5/thumbnails/6.jpg)
6
Example 1: Junction Tree Construction
Step4: Ordered the node by max cardinality search.
Five cliques are found in Example 1:• One clique of four nodes• Four cliques of three nodes
Definition: A Clique in a graph is set of adjacent vertices which is a complete graph.
ABCDE
ACD
CDF
CEH
EHG
4
5
6
7
8
A B
D C
GHF
E
1 2
3 45
6 78
![Page 7: Junction Tree Construction](https://reader035.fdocuments.net/reader035/viewer/2022062323/5681610f550346895dd067bd/html5/thumbnails/7.jpg)
7
Example 1: Junction Tree Construction
ABCDE
ACD CEH
CDF EHG
ABCDE
ACD
CDF
CEH
EHG
5
6
7
8
4Construct Tree
![Page 8: Junction Tree Construction](https://reader035.fdocuments.net/reader035/viewer/2022062323/5681610f550346895dd067bd/html5/thumbnails/8.jpg)
8
Example 2: Junction Tree Construction
A
B DC
G
H
FE
Step1: Insert link between parents of common child
I
![Page 9: Junction Tree Construction](https://reader035.fdocuments.net/reader035/viewer/2022062323/5681610f550346895dd067bd/html5/thumbnails/9.jpg)
9
Example 2: Junction Tree Construction
Step2: Convert into undirected graph
A
B DC
G
H
FE
I
A
B DC
G
H
FE
I
![Page 10: Junction Tree Construction](https://reader035.fdocuments.net/reader035/viewer/2022062323/5681610f550346895dd067bd/html5/thumbnails/10.jpg)
10
Example 2: Junction Tree Construction
A
B DC
G
H
FE
I
Step3: Triangulate a graph if it has circle of length>3
![Page 11: Junction Tree Construction](https://reader035.fdocuments.net/reader035/viewer/2022062323/5681610f550346895dd067bd/html5/thumbnails/11.jpg)
11
Example 2: Junction Tree Construction
Step3: Numbered the node if its numbered neighboured nodes are connected together.A
B DC
G
H
FE
I
1
42 3
5
F has three numbered neighbour B, C and D where B and D are not connected therefore add link between B and D and restart numbering again from beginning.
![Page 12: Junction Tree Construction](https://reader035.fdocuments.net/reader035/viewer/2022062323/5681610f550346895dd067bd/html5/thumbnails/12.jpg)
12
Example 2: Junction Tree Construction
Step3: Numbered the node if its numbered neighboured nodes are connected together.
1
42 3
756
98
A
B DC
G
H
FE
I
![Page 13: Junction Tree Construction](https://reader035.fdocuments.net/reader035/viewer/2022062323/5681610f550346895dd067bd/html5/thumbnails/13.jpg)
13
Example 2: Junction Tree Construction
Step4: Ordered the node by max cardinality search.
Five cliques are found in Example 2:• Two cliques of four
nodes• Four cliques of three
nodes 1
42 3
756
98
A
B DC
G
H
FE
I
Clique NodesMax Cardinality
BCDF
BEF
DFG
EFH
FGI
4
5
6
7
8
ABCD
9
![Page 14: Junction Tree Construction](https://reader035.fdocuments.net/reader035/viewer/2022062323/5681610f550346895dd067bd/html5/thumbnails/14.jpg)
14
Example 2: Junction Tree Construction
ABCD
BCDF
DFGBEF
FGI
BCDF
BEF
DFG
EFH
FGI
4
5
6
7
8
ABCD
9
EFH
Construct Tree
![Page 15: Junction Tree Construction](https://reader035.fdocuments.net/reader035/viewer/2022062323/5681610f550346895dd067bd/html5/thumbnails/15.jpg)
15
Example 2: Junction Tree Construction (with different triangulation )
A
B DC
G
H
FE
Step1: Insert link between parents of common child
I
![Page 16: Junction Tree Construction](https://reader035.fdocuments.net/reader035/viewer/2022062323/5681610f550346895dd067bd/html5/thumbnails/16.jpg)
16
Example 2: Junction Tree Construction
Step2: Convert into undirected graph
A
B DC
G
H
FE
I
A
B DC
G
H
FE
I
![Page 17: Junction Tree Construction](https://reader035.fdocuments.net/reader035/viewer/2022062323/5681610f550346895dd067bd/html5/thumbnails/17.jpg)
17
Example 2: Junction Tree Construction
A
B DC
G
H
FE
I
Step3: Triangulate a graph if it has circle of length>3
![Page 18: Junction Tree Construction](https://reader035.fdocuments.net/reader035/viewer/2022062323/5681610f550346895dd067bd/html5/thumbnails/18.jpg)
18
Example 2: Junction Tree Construction
Step3: Numbered the node if its numbered neighboured nodes are connected together.
1
42 3
6
G has three numbered neighbour F, C and D where F and D are not connected therefore add link between F and D and restart numbering again from beginning.
5 7
A
B DC
G
H
FE
I
![Page 19: Junction Tree Construction](https://reader035.fdocuments.net/reader035/viewer/2022062323/5681610f550346895dd067bd/html5/thumbnails/19.jpg)
19
Example 2: Junction Tree Construction
Step3: Numbered the node if its numbered neighboured nodes are connected together.
1
42 3
65
A
B DC
G
H
FE
I
F has three numbered neighbour E, C and D where E and D are not connected therefore add link between E and D and restart numbering again from beginning.
![Page 20: Junction Tree Construction](https://reader035.fdocuments.net/reader035/viewer/2022062323/5681610f550346895dd067bd/html5/thumbnails/20.jpg)
20
Example 2: Junction Tree Construction
Step3: Numbered the node if its numbered neighboured nodes are connected together.
1
42 3
5
A
B DC
G
H
FE
I
E has three numbered neighbour B, C and D where B and D are not connected therefore add link between B and D and restart numbering again from beginning.
![Page 21: Junction Tree Construction](https://reader035.fdocuments.net/reader035/viewer/2022062323/5681610f550346895dd067bd/html5/thumbnails/21.jpg)
21
Example 2: Junction Tree Construction
Step3: Numbered the node if its numbered neighboured nodes are connected together.
1
42 3
65
A
B DC
G
H
FE
I
7
8 9
![Page 22: Junction Tree Construction](https://reader035.fdocuments.net/reader035/viewer/2022062323/5681610f550346895dd067bd/html5/thumbnails/22.jpg)
22
Example 2: Junction Tree Construction
Step4: Ordered the node by max cardinality search.
Cliques are found in Example 2: • Four cliques of four
nodes.• Two cliques of three
nodes.Clique NodesMax
Cardinality
BCDE
CDEF
CDFG
EFH
FGI
45
6
7
8
ABCD
9
1
42 3
65
A
B DC
G
H
FE
I
7
8 9
![Page 23: Junction Tree Construction](https://reader035.fdocuments.net/reader035/viewer/2022062323/5681610f550346895dd067bd/html5/thumbnails/23.jpg)
23
Example 2: Junction Tree Construction
Construct TreeBCD
ECDE
FCDF
GEFH
FGI
45
6
7
8
ABCD
9
ABCD
BCDE
CDEF
CDFG
FGI
EFH