Junction Trees Motivation University of 结树动机大学.pptVIP

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Better Triangulation Algorithm Specifically for Bayes Nets, Based on Variable Elimination Repeat until no nodes remain: If the graph has a simplicial node, eliminate it (consider it “processed” and remove it together with all its edges). Otherwise, find the node whose elimination would give the smallest potential possible. Eliminate that node, and note the need for a “fill-in” edge between any two non-adjacent nodes in the resulting potential. Add the “fill-in” edges to the original graph