Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams

DOI10.1016/J.IJAR.2015.03.007zbMATH Open1346.68203OpenAlexW2174277655WikidataQ62046522 ScholiaQ62046522MaRDI QIDQ895536FDOQ895536

Authors: D. D. Maua 

Publication date: 3 December 2015

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.03.007

Recommendations

• Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams
• scientific article; zbMATH DE number 2243356
• Approximating MAPs for belief networks is NP-hard and other theorems
• Most probable explanations in Bayesian networks: complexity and tractability
• The complexity of approximating MAPs for belief networks with bounded probabilities

zbMATH Keywords

computational complexityBayesian networksinfluence diagramsmaximum expected utilitymaximum a posteriori inference

Mathematics Subject Classification ID

Multivariate analysis (62H99) Reasoning under uncertainty in the context of artificial intelligence (68T37) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Speeding up \(k\)-neighborhood local search in limited memory influence diagrams
• Probabilistic graphical models.
• Probabilistic graphical models
• The necessity of bounded treewidth for efficient inference in Bayesian networks
• Title not available (Why is that?)
• Risk, ambiguity and the Savage axioms
• Bayesian Networks and Decision Graphs
• Introduction to imprecise probabilities
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• Representing and solving decision problems with limited information
• Mini-buckets: a general scheme for bounded inference
• Title not available (Why is that?)
• Sequential decision making with partially ordered preferences
• Credal networks
• 2U: an exact interval propagation algorithm for polytrees with binary variables
• Binary join trees for computing marginals in the Shenoy-Shafer architecture
• A computational theory of decision networks
• Solving limited memory influence diagrams
• On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables
• Probabilistic inference in credal networks: new complexity results
• Updating credal networks is approximable in polynomial time

Cited In (2)

• An integrated approach to solving influence diagrams and finite-horizon partially observable decision processes
• Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams

Uses Software

• k-Neighborhood

This page was built for publication: Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q895536)