Optimal Junction Trees
Artificial Intelligence
2013-02-28 v1
Abstract
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.
Cite
@article{arxiv.1302.6823,
title = {Optimal Junction Trees},
author = {Finn Verner Jensen and Frank Jensen},
journal= {arXiv preprint arXiv:1302.6823},
year = {2013}
}
Comments
Appears in Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence (UAI1994)