Structure approximation of most probable explanations in Bayesian networks

DOI10.1007/978-3-642-39091-3_29MaRDI QIDQ5326431zbMATH OpenOpenAlexFDO

Authors Johan Kwisthout

Publication date 5 August 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39091-3_29

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• scientific article; zbMATH DE number 2243356
• Approximating MAPs for belief networks is NP-hard and other theorems
• The complexity of approximating MAPs for belief networks with bounded probabilities
• MPE Computation in Bayesian Networks Using Mini-Bucket and Probability Trees Approximation
• Most probable explanations in Bayesian networks: complexity and tractability

Cited in

(7)

• Tractability of most probable explanations in multidimensional Bayesian network classifiers
• Most frugal explanations in Bayesian networks
• Finding consensus Bayesian network structures
• Most probable explanations in Bayesian networks: complexity and tractability
• Most Inforbable Explanations: Finding Explanations in Bayesian Networks That Are Both Probable and Informative
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• MPE Computation in Bayesian Networks Using Mini-Bucket and Probability Trees Approximation

This page was built for publication: Structure approximation of most probable explanations in Bayesian networks

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