Abstract
Recently, Simple Propagation was introduced as an algorithm for belief update in Bayesian networks using message passing in a junction tree. The algorithm differs from other message passing algorithms such as Lazy Propagation in the message construction process. The message construction process in Simple Propagation identifies relevant potentials and variables to eliminate using the one-in, one-out-principle. This paper introduces Simple Propagation as a solution algorithm for influence diagrams with discrete variables. The one-in, one-out-principle is not directly applicable to influence diagrams. Hence, the principle is extended to cope with decision variables, utility functions, and precedence constraints to solve influence diagrams. Simple Propagation is demonstrated on an extensive example and a number of useful and interesting properties of the algorithm are described.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Howard, R.A., Matheson, J.E.: Influence diagrams. In: Readings in Decision Analysis, pp. 763–771. Strategic Decisions Group, Menlo Park (1981)
Kjærulff, U.B., Madsen, A.L.: Bayesian Networks and Influence Diagrams: A Guide to Construction and Analysis, 2nd edn. Springer, New York (2013). https://doi.org/10.1007/978-0-387-74101-7
Koller, D., Friedman, N.: Probabilistic Graphical Models — Principles and Techniques. MIT Press, Cambridge (2009)
Lauritzen, S.L., Nilsson, D.: Representing and solving decision problems with limited information. Manage. Sci. 47, 1238–1251 (2001)
Jensen, F.V., Vomlelova, M.: Unconstrained influence diagrams. In: Proceedings of Uncertainty in Artificial Intelligence Conference, pp. 234–241 (2002)
Madsen, A.L., Jensen, F.: Mixed influence diagrams. In: Nielsen, T.D., Zhang, N.L. (eds.) ECSQARU 2003. LNCS (LNAI), vol. 2711, pp. 208–219. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-45062-7_17
Nilsson, D., Jensen, F.V.: Probabilities of future decisions. In: Bouchon-Meunier, B., Yager, R.R., Zadeh, L.A. (eds.) Information, Uncertainty and Fusion. The Springer International Series in Engineering and Computer Science, vol. 516, pp. 161–171. Springer, Boston (2000). https://doi.org/10.1007/978-1-4615-5209-3_12
Olmsted, S.M.: On representing and solving decision problems. Ph.D. thesis, Department of Engineering-Economic Systems, Stanford University, Stanford, CA (1983)
Shachter, R.D.: Evaluating influence diagrams. Oper. Res. 34(6), 871–882 (1986)
Shachter, R.D., Peot, M.A.: Decision making using probabilistic inference methods. In: Proceedings of the Eighth Conference on Uncertainty in Artificial Intelligence, pp. 276–283. Morgan Kaufmann Publishers, San Mateo (1992)
Shenoy, P.P.: Valuation-based systems for Bayesian decision analysis. Oper. Res. 40(3), 463–484 (1992)
Jensen, F., Jensen, F.V., Dittmer, S.: From influence diagrams to junction trees. In: Proceedings of Uncertainty in Artificial Intelligence Conference, pp. 367–373. Morgan Kaufmann Publishers, San Francisco (1994)
Madsen, A.L., Jensen, F.V.: Lazy evaluation of symmetric Bayesian decision problems. In: Proceedings of Uncertainty in Artificial Intelligence Conference, pp. 382–390 (1999)
Cooper, G.F.: A method for using belief networks as influence diagrams. In: Proceedings of Uncertainty in Artificial Intelligence Conference, pp. 55–63 (1988)
Yang, M., Zhou, L., Ruan, H.: The methods for solving influence diagrams: a review. In: International Conference on Information Technology and Applications, pp. 427–431 (2013)
Jensen, F.V., Nielsen, T.D.: Probabilistic decision graphs for optimization under uncertainty. 4OR-Q J. Oper. Res. 9(1), 1–28 (2011)
Lee, J., Ihler, A., Dechter, R.: Join graph decomposition bounds for influence diagrams. In: Proceedings of Uncertainty in Artificial Intelligence Conference, pp. 1053–1062 (2018)
Yet, B., Neil, M., Fenton, N., Constantinou, A., Demetiev, E.: An improved method for solving hybrid influence diagrams. IJAR 95, 93–112 (2018)
Butz, C.J., de Oliveira, J.S., dos Santos, A.E., Madsen, A.L.: Bayesian network inference with simple propagation. In: Proceedings of Florida Artificial Intelligence Research Society Conference, pp. 650–655 (2016)
Madsen, A.L., Jensen, F.V.: Lazy propagation: a junction tree inference algorithm based on lazy evaluation. Artif. Intell. 113(1–2), 203–245 (1999)
Cabañas, R., Cano, A., Gómez-Olmedo, M., Madsen, A.L.: On SPI-lazy evaluation of influence diagrams. In: van der Gaag, L.C., Feelders, A.J. (eds.) PGM 2014. LNCS (LNAI), vol. 8754, pp. 97–112. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-11433-0_7
Madsen, A.L., Nilsson, D.: Solving influence diagrams using HUGIN, Shafer-Shenoy and lazy propagation. In: Proceedings of Uncertainty in Artificial Intelligence Conference, pp. 337–345 (2001)
Nielsen, T.D., Jensen, F.V.: Welldefined decision scenarios. In: Proceedings of Uncertainty in Artificial Intelligence Conference, pp. 502–511 (1999)
Nielsen, T.D.: Decomposition of influence diagrams. In: Benferhat, S., Besnard, P. (eds.) ECSQARU 2001. LNCS (LNAI), vol. 2143, pp. 144–155. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-44652-4_14
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Madsen, A.L., Butz, C.J., Oliveira, J., dos Santos, A.E. (2019). Solving Influence Diagrams with Simple Propagation. In: Meurs, MJ., Rudzicz, F. (eds) Advances in Artificial Intelligence. Canadian AI 2019. Lecture Notes in Computer Science(), vol 11489. Springer, Cham. https://doi.org/10.1007/978-3-030-18305-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-18305-9_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-18304-2
Online ISBN: 978-3-030-18305-9
eBook Packages: Computer ScienceComputer Science (R0)