From Influence Diagrams to Junction Trees

02/27/2013
by   Frank Jensen, et al.
0

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.

READ FULL TEXT

page 1

page 7

research
02/27/2013

Solving Asymmetric Decision Problems with Influence Diagrams

While influence diagrams have many advantages as a representation framew...
research
02/17/2020

Overlaid oriented Voronoi diagrams and the 1-Steiner tree problem

Overlaid oriented Voronoi diagrams (OOVDs) are known to provide useful d...
research
02/13/2013

Flexible Policy Construction by Information Refinement

We report on work towards flexible algorithms for solving decision probl...
research
02/06/2013

Myopic Value of Information in Influence Diagrams

We present a method for calculation of myopic value of information in in...
research
03/06/2013

Two Procedures for Compiling Influence Diagrams

Two algorithms are presented for "compiling" influence diagrams into a s...
research
05/01/2018

State Diagrams of a Class of Singular LFSR and Their Applications to the Construction of de Bruijn Cycles

The state diagrams of a class of singular linear feedback shift register...
research
12/12/2012

Unconstrained Influence Diagrams

We extend the language of influence diagrams to cope with decision scena...

Please sign up or login with your details

Forgot password? Click here to reset