An ordered examination of influence diagrams
- 1 August 1990
- Vol. 20 (5) , 535-563
- https://doi.org/10.1002/net.3230200505
Abstract
Influence diagrams are a directed network representation for decision making under uncertainty. The nodes in the diagram represent uncertain and decision variables, and the arcs indicate probabilistic dependence and observability. This paper examines the graphical orderings underlying the influence diagram and the primitive interchange operations that can reorder the network. These operations are sufficient to determine the maximal independent set and minimal relevant sets for any given inference problem, and a linear time algorithm is developed to obtain those sets. This framework is also used to examine and explain properties of the time structure of general influence diagrams with decisions.Keywords
This publication has 8 references indexed in Scilit:
- Identifying independence in bayesian networksNetworks, 1990
- Independence properties of directed markov fieldsNetworks, 1990
- Influence Diagrams for Statistical ModellingThe Annals of Statistics, 1989
- Probabilistic Inference and Influence DiagramsOperations Research, 1988
- Evaluating Influence DiagramsOperations Research, 1986
- A Constraint – Propagation Approach to Probabilistic Reasoning* *This work was supported in part by the National Science Foundation, Grant #DSR 83–13875Published by Elsevier ,1986
- Interval graphs and interval ordersDiscrete Mathematics, 1985
- Conditional Independence in Statistical TheoryJournal of the Royal Statistical Society Series B: Statistical Methodology, 1979