ML Anthology

Optimal Junction Trees

Finn Verner Jensen, Frank Jensen
UAI 1994 pp. 360-366
doi:10.1016/B978-1-55860-332-5.50050-X /uai/1994/jensen1994uai-optimal/

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.

PDF UAI Semantic Scholar

Cite

Text

Jensen and Jensen. "Optimal Junction Trees." Conference on Uncertainty in Artificial Intelligence, 1994. doi:10.1016/B978-1-55860-332-5.50050-X

Markdown

[Jensen and Jensen. "Optimal Junction Trees." Conference on Uncertainty in Artificial Intelligence, 1994.](https://mlanthology.org/uai/1994/jensen1994uai-optimal/) doi:10.1016/B978-1-55860-332-5.50050-X

BibTeX

@inproceedings{jensen1994uai-optimal,
  title     = {{Optimal Junction Trees}},
  author    = {Jensen, Finn Verner and Jensen, Frank},
  booktitle = {Conference on Uncertainty in Artificial Intelligence},
  year      = {1994},
  pages     = {360-366},
  doi       = {10.1016/B978-1-55860-332-5.50050-X},
  url       = {https://mlanthology.org/uai/1994/jensen1994uai-optimal/}
}