junction_tree.pptVIP

Junction tree Algorithm 10-708:Probabilistic Graphical Models Recitation: 10/04/07 Ramesh Nallapati Cluster Graphs A cluster graph K for a set of factors F is an undirected graph with the following properties: Each node i is associated with a subset Ci ? X Family preserving property: each factor ? is such that scope[?] μ Ci Each edge between Ci and Cj is associated with a sepset Sij = Ci ? Cj Execution of variable elimination defines a cluster-graph Each factor used in elimination becomes a cluster-node An edge is drawn between two clusters if a message is passed between them in elimination