论文信息 - Compiling influence diagrams

Compiling influence diagrams

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.

Paul E. Lehner | Azar Sadigh | P. Lehner | A. Sadigh

[1] Michael P. Wellman,et al. Planning and Control , 1991 .

[2] Alexander H. Levis,et al. On the Generation of Organizational Architectures Using Petri Nets , 1988, European Workshop on Applications and Theory of Petri Nets.

[3] Gerhard Paass,et al. Integrating Probabilistic Rules into Neural Networks: A Stochastic EM Learning Algorithm , 1991, UAI.

[4] Paul E. Lehner,et al. Cognitive Factors in User/Expert-System Interaction , 1987 .

[5] Judea Pearl,et al. Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[6] Max Henrion,et al. Propagating uncertainty in bayesian networks by probabilistic logic sampling , 1986, UAI.

[7] David Heckerman,et al. Decision-theoretic case-based reasoning , 1994, IEEE Trans. Syst. Man Cybern. Part A.

[8] Gregory F. Cooper,et al. The Computational Complexity of Probabilistic Inference Using Bayesian Belief Networks , 1990, Artif. Intell..

[9] S. A. Zaidi. On the Generation of Multilevel Distributed Intelligence Systems Using Petri Nets , 1991 .

[10] Dennis M. Buede,et al. Superior design features of decision analytic software , 1992, Comput. Oper. Res..

[11] Theresa M. Mullin,et al. A Probability Analysis of the Usefulness of Decision Aids , 1989, UAI.