On stopping evidence gathering for diagnostic Bayesian networks

Authors:
Linda C. Van Der Gaag;Hans L. Bodlaender
Affiliations:
Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands;Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands
Venue:
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
Year:
2011

Citing 9
Cited 1

The complexity of combinatorial problems with succinct input representation

Acta Informatica
Printer troubleshooting using Bayesian networks

IEA/AIE '00 Proceedings of the 13th international conference on Industrial and engineering applications of artificial intelligence and expert systems: Intelligent problem solving: methodologies and approaches
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Stochastic Boolean Satisfiability

Journal of Automated Reasoning
Enhancing Automated Test Selection in Probabilistic Networks

AIME '07 Proceedings of the 11th conference on Artificial Intelligence in Medicine
A dynamic Bayesian network for diagnosing ventilator-associated pneumonia in ICU patients

Expert Systems with Applications: An International Journal
Bayesian Networks and Decision Graphs

Bayesian Networks and Decision Graphs
Complexity results and approximation strategies for MAP explanations

Journal of Artificial Intelligence Research
Modelling patterns of evidence in Bayesian networks: a case-study in classical swine fever

IPMU'10 Proceedings of the Computational intelligence for knowledge-based systems design, and 13th international conference on Information processing and management of uncertainty

An exact algorithm for computing the same-decision probability

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sequential approaches to automated test selection for diagnostic Bayesian networks include a stopping criterion for deciding in each iteration whether or not gathering of further evidence is opportune. We study the computational complexity of the problem of deciding when to stop evidence gathering in general and show that it is complete for the complexity class NPPP; we show that the problem remains NP-complete even when it is restricted to networks of bounded treewidth. We will argue however, that by reasonable further restrictions the problem can be feasibly solved for many realistic applications.