Tree-width and the computational complexity of MAP approximations in Bayesian networks

DOI10.1613/JAIR.4794MaRDI QIDQ2941745zbMATH OpenOpenAlexWikidataFDO

Authors Johan Kwisthout

Publication date 25 August 2015

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.4794

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Treewidth and the Computational Complexity of MAP Approximations
• 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
• Maximum likelihood bounded tree-width Markov networks

Cited in

(9)

• Approximating MAPs for belief networks is NP-hard and other theorems
• Approximate inference in Bayesian networks: parameterized complexity results
• Maximum likelihood bounded tree-width Markov networks
• Explainable AI using MAP-independence
• Motivating explanations in Bayesian networks using MAP-independence
• scientific article; zbMATH DE number 5968954 (Why is no real title available?)
• Complexity of Hierarchical Trees in Evidence Theory
• Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited
• Inapproximability of treewidth and related problems

This page was built for publication: Tree-width and the computational complexity of MAP approximations in Bayesian networks

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