On Stopping Evidence Gathering for Diagnostic Bayesian Networks

DOI10.1007/978-3-642-22152-1_15zbMath1341.62259OpenAlexW38244107WikidataQ59567605 ScholiaQ59567605MaRDI QIDQ3011944

Linda C. van der Gaag, Hans L. Bodlaender

Publication date: 29 June 2011

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-22152-1_15

Mathematics Subject Classification ID

Bayesian problems; characterization of Bayes procedures (62C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Optimal stopping in statistics (62L15)

Related Items

Explainable AI using MAP-independence ⋮ Motivating explanations in Bayesian networks using MAP-independence

Cites Work

• The complexity of combinatorial problems with succinct input representation
• Bayesian Networks and Decision Graphs
• Stochastic Boolean satisfiability
• Unnamed Item
• Unnamed Item
• Unnamed Item