Title :
Compiling influence diagrams
Author :
Lehner, Paul E. ; Sadigh, Azar
Author_Institution :
Dept. of Syst. Eng., George Mason Univ., Fairfax, VA, USA
fDate :
1/1/1996 12:00:00 AM
Abstract :
This paper examines a class of algorithms for “compiling” influence diagrams into a set of simple decision rules. These decision rules define simple-to-execute, complete, consistent, and near-optimal decision procedures. These compilation algorithms can be used to derive decision procedures for manually solving time constrained decision problems
Keywords :
computational complexity; decision theory; inference mechanisms; trees (mathematics); compilation algorithms; influence diagrams; near-optimal decision procedures; simple decision rules; time constrained decision problems; Bayesian methods; Computer networks; Decision theory; Inference algorithms; Medical diagnosis; Medical tests; Probability distribution; Testing; Time factors; Uncertainty;
Journal_Title :
Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on
DOI :
10.1109/3468.477866
