Motivating explanations in Bayesian networks using MAP-independence

DOI10.1016/J.IJAR.2022.11.012MaRDI QIDQ2677844zbMATH OpenOpenAlexFDO

Authors Johan Kwisthout

Publication date 6 January 2023

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2208.03121

zbMATH Keywords

Bayesian networkscomputational complexityexplainable AImost probable explanationsrelevance

Mathematics Subject Classification ID

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

Cites work

• Explainable AI using MAP-independence
• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• scientific article; zbMATH DE number 2243356 (Why is no real title available?)
• Modeling and Reasoning with Bayesian Networks
• Most Inforbable Explanations: Finding Explanations in Bayesian Networks That Are Both Probable and Informative
• Most probable explanations in Bayesian networks: complexity and tractability
• Most relevant explanation in Bayesian networks
• On stopping evidence gathering for diagnostic Bayesian networks
• Relevance of evidence in Bayesian networks
• Same-decision probability: a confidence measure for threshold-based decisions
• The complexity of combinatorial problems with succinct input representation
• The computational complexity of probabilistic inference using Bayesian belief networks
• Tree-width and the computational complexity of MAP approximations in Bayesian networks

Cited in

(1)

• Efficient search for relevance explanations using MAP-independence in Bayesian networks

This page was built for publication: Motivating explanations in Bayesian networks using MAP-independence

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