Improvements to variable elimination and symbolic probabilistic inference for evaluating influence diagrams

DOI10.1016/j.ijar.2015.11.011zbMath1351.68282OpenAlexW2204446191WikidataQ57551146 ScholiaQ57551146MaRDI QIDQ5963135

Rafael Cabañas, Anders L. Madsen, Andrés Cano, Manuel Gómez-Olmedo

Publication date: 4 March 2016

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2015.11.011

zbMATH Keywords

heuristic algorithmlazy evaluationinfluence diagramscombinatorial optimization problemexact evaluationprobabilistic graphical models

Mathematics Subject Classification ID

Bayesian problems; characterization of Bayes procedures (62C10) Reasoning under uncertainty in the context of artificial intelligence (68T37) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

An integrated approach to solving influence diagrams and finite-horizon partially observable decision processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient inference in Bayes networks as a combinatorial optimization problem
• Binary join trees for computing marginals in the Shenoy-Shafer architecture
• A note about redundancy in influence diagrams
• Lazy propagation: A junction tree inference algorithm based on lazy evaluation
• On SPI for evaluating influence diagrams
• Graph minors. IV: Tree-width and well-quasi-ordering
• On SPI-Lazy Evaluation of Influence Diagrams
• Bayesian Networks and Decision Graphs
• Bayesian Networks and Influence Diagrams: A Guide to Construction and Analysis
• Identifying independence in bayesian networks
• A linear time algorithm for finding tree-decompositions of small treewidth

This page was built for publication: Improvements to variable elimination and symbolic probabilistic inference for evaluating influence diagrams