Search-based methods to bound diagnostic probabilities in very large belief nets

Authors:
Max Henrion
Affiliations:
Rockwell International Science Center, Palo Alto Laboratory, Palo Alto, CA
Venue:
UAI'91 Proceedings of the Seventh conference on Uncertainty in Artificial Intelligence
Year:
1991

Citing 10
Cited 1

Fusion, propagation, and structuring in belief networks

Artificial Intelligence
A probabilistic causal model for diagnostic problem solving, part one: integrating symbolic causal inference with numeric probabilistic inference

IEEE Transactions on Systems, Man and Cybernetics - Special issue on artificial intelligence
Uncertainty in artificial intelligence: Is probability epistemologically and heuristically accurate?

Expert judgment and expert systems
Decision theory in expert systems and artificial intelligence

International Journal of Approximate Reasoning
The computational complexity of probabilistic inference using Bayesian belief networks (research note)

Artificial Intelligence
A comfort measure for diagnostic problem solving

Information Sciences: an International Journal
A Tractable Inference Algorithm for Diagnosing Multiple Diseases

UAI '89 Proceedings of the Fifth Annual Conference on Uncertainty in Artificial Intelligence
An Introduction to Algorithms for Inference in Belief Nets

UAI '89 Proceedings of the Fifth Annual Conference on Uncertainty in Artificial Intelligence
Weighing and Integrating Evidence for Stochastic Simulation in Bayesian Networks

UAI '89 Proceedings of the Fifth Annual Conference on Uncertainty in Artificial Intelligence
A new algorithm for finding MAP assignments to belief networks

UAI '90 Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence

Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Since exact probabilistic inference is intractable in general for large multiply connected belief nets, approximate methods are required. A promising approach is to use heuristic search among hypotheses (instantiations of the network) to find the most probable ones, as in the TopN algorithm. Search is based on the relative probabilities of hypotheses which are efficient to compute. Given upper and lower bounds on the relative probability of partial hypotheses, it is possible to obtain bounds on the absolute probabilities of hypotheses. Best-first search aimed at reducing the maximum error progressively narrows the bounds as more hypotheses are examined. Here, qualitative probabilistic analysis is employed to obtain bounds on the relative probability of partial hypotheses for the BN20 class of networks networks and a generalization replacing the noisy OR assumption by negative synergy. The approach is illustrated by application to a very large belief network, QMR-BN, which is a reformulation of the Internist-1 system for diagnosis in internal medicine.