Optimal Junction Trees
Finn Jensen, Frank Jensen
The paper deals with optimality issues in connection with updating beliefs in networks. We address two processes: triangulation and construction of junction trees. In the first part, we give a simple algorithm for constructing an optimal junction tree from a triangulated network. In the second part, we argue that any exact method based on local calculations must either be less efficient than the junction tree method, or it has an optimality problem equivalent to that of triangulation.
Keywords: Junction tree, join tree, Bayesian networks, Markov networks, belief updating, triang
PS Link: ftp://ftp.iesd.auc.dk/pub/reports/papers/jensen:jensen:94.ps.gz
PDF Link: /papers/94/p360-jensen.pdf
AUTHOR = "Finn Jensen
and Frank Jensen",
TITLE = "Optimal Junction Trees",
BOOKTITLE = "Proceedings of the Tenth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-94)",
PUBLISHER = "Morgan Kaufmann",
ADDRESS = "San Francisco, CA",
YEAR = "1994",
PAGES = "360--366"