From Influence Diagrams to Junction Trees

Frank Jensen, Finn Verner Jensen, Søren L. Dittmer

UAI 1994 pp. 367-373

doi:10.1016/B978-1-55860-332-5.50051-1 /uai/1994/jensen1994uai-influence/

Abstract

We present an approach to the solution of decision problems formulated as influence diagrams. This approach involves a special triangulation of the underlying graph, the construction of a junction tree with special properties, and a message passing algorithm operating on the junction tree for computation of expected utilities and optimal decision policies.

PDF UAI Semantic Scholar

Cite

Text

Jensen et al. "From Influence Diagrams to Junction Trees." Conference on Uncertainty in Artificial Intelligence, 1994. doi:10.1016/B978-1-55860-332-5.50051-1

Markdown

[Jensen et al. "From Influence Diagrams to Junction Trees." Conference on Uncertainty in Artificial Intelligence, 1994.](https://mlanthology.org/uai/1994/jensen1994uai-influence/) doi:10.1016/B978-1-55860-332-5.50051-1

BibTeX

@inproceedings{jensen1994uai-influence,
  title     = {{From Influence Diagrams to Junction Trees}},
  author    = {Jensen, Frank and Jensen, Finn Verner and Dittmer, Søren L.},
  booktitle = {Conference on Uncertainty in Artificial Intelligence},
  year      = {1994},
  pages     = {367-373},
  doi       = {10.1016/B978-1-55860-332-5.50051-1},
  url       = {https://mlanthology.org/uai/1994/jensen1994uai-influence/}
}