From Influence Diagrams to Junction Trees

Preprint

27 February 2013

preprint
Published by arXiv in arXiv

https://doi.org/10.48550/arXiv.1302.6824

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.

Keywords

SPECIAL TRIANGULATION
INFLUENCE DIAGRAMS
JUNCTION TREE
ALGORITHM
POLICIES
MESSAGE
GRAPH
TREE

All Related Versions

Version 1, 2013-02-27, ArXiv

This publication has 0 references indexed in Scilit: