Solving multistage influence diagrams using branch-and-bound search

Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence, UAI 2010

Volumn , Issue , 2010, Pages 691-700

  Yuan, Changhe ^a   Wu, Xiaojian ^a   Hansen, Eric A ^a  

^a MISSISSIPPI STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

BRANCH AND BOUND SEARCH; BRANCH-AND-BOUND APPROACHES; DEPTH FIRST; INFLUENCE DIAGRAM; MULTI-STAGE INFLUENCE DIAGRAMS; MULTIPLE STAGES;

BRANCH AND BOUND METHOD;

EID: 80053156789     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. S. Acid and L. de Campos. An algorithm for finding minimum d-separating sets in belief networks. In Proceedings of the 12th Annual Conference on Uncertainty in Artificial Intelligence (UAI-96), pages 3-10, San Francisco, CA, 1996. Morgan Kaufmann.
2. D. Bhattacharjya and R. Shachter. Evaluating influence diagrams with decision circuits. In Proceedings of the Twenty-Third Conference on Uncertainty in Artificial Intelligence, pages 9-16. AUAI Press, 2007.
3. G. Cooper. A method for using belief networks as influence diagrams. In Proceedings of the Fourth Conference on Uncertainty in Artificial Intelligence, pages 55-63, Minneapolis, MN, USA, 1988. Elsevier Science, New York, NY.
4. R. Dechter. An anytime approximation for optimizing policies under uncertainty. In Workshop on Decision Theoretic Planning, at the 5th International Conference on Artificial Intelligence Planning Systems (AIPS-2000), Breckenridge, CO, USA, 2000.
5. L. R. Ford and D. R. Fulkerson. Maximal flow through a network. Canadian Journal of Mathematics, 8:399-404, 1956.
6. M. C. Horsch and D. Poole. An anytime algorithm for decision making under uncertainty. In Proceedings of the 14th Annual Conference on Uncertainty in Artificial Intelligence (UAI-98), 1998.
7. R. A. Howard and J. E. Matheson. Influence diagrams. In R. A. Howard and J. E. Matheson., editors, The Principles and Applications of Decision Analysis, pages 719-762, Menlo Park, CA, 1981.
8. F. Jensen, F. V. Jensen, and S. L. Dittmer. From influence diagrams to junction trees. In Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence, pages 367-373. Morgan Kaufmann, 1994.
9. F. V. Jensen. Unconstrained influence diagrams. In Proc. of the 18th International Conference on Uncertainty in Artificial Intelligence (UAI-02), pages 234-241. Morgan Kaufmann Publishers, 2002.
10. S. L. Lauritzen and D. Nilsson. Representing and solving decision problems with limited information. Management Science, 47:1235-1251, 2001. (Pubitemid 34192827)
11. S. L. Lauritzen and D. J. Spiegelhalter. Local computations with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society, Series B (Methodological), 50(2):157-224, 1988.
12. R. Marinescu. A new approach to influence diagram evaluation. In Proceedings of the 29th SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence, Cambridge, UK, 2009.
13. T. D. Nielsen and F. V. Jensen. Welldefined decision scenarios. In Proceedings of the 15th Annual Conference on Uncertainty in Artificial Intelligence (UAI-99), pages 502- 511, 1999.
14. D. Nilsson and M. Hohle. Computing bounds on expected utilities for optimal policies based on limited information. Technical Report 94, Dina Research, 2001.
15. S. M. Olmsted. On representing and solving decision problems. PhD thesis, Stanford University, Engineering-Economic Systems Department, 1983.
16. J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers, Inc., San Mateo, CA, 1988.
17. R. Qi and D. Poole. A new method for influence diagram evaluation. Computational Intelligence, 11:498-528, 1995.
18. R. D. Shachter. Evaluating influence diagrams. Oper. Res., 34(6):871-882, 1986.
19. P. Shenoy. Valuation based systems for Bayesian decision analysis. Operations Research, 40:463-484, 1992.
20. C. Yuan and E. A. Hansen. Efficient computation of join-tree bounds for systematic MAP search. In Proceedings of 21st International Joint Conference on Artificial Intelligence (IJCAI-09), pages 1982-1989, Pasadena, CA, 2009.
21. N. L. Zhang. Probabilistic inference in influence diagrams. In Computational Intelligence, pages 514-522, 1998.