An anytime scheme for bounding posterior beliefs

Authors:
Bozhena Bidyuk;Rina Dechter
Affiliations:
Donald Bren School of Information and Computer Science, University of California Irvine;Donald Bren School of Information and Computer Science, University of California Irvine
Venue:
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Year:
2006

Citing 10
Cited 4

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
Approximating probabilistic inference in Bayesian belief networks is NP-hard

Artificial Intelligence
Probabilistic conflicts in a search algorithm for estimating posterior probabilities in Bayesian networks

Artificial Intelligence
Bucket elimination: a unifying framework for reasoning

Artificial Intelligence
Improving Bound Propagation

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Bound propagation

Journal of Artificial Intelligence Research
Cycle-cutset sampling for Bayesian networks

AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
A sufficiently fast algorithm for finding close to optimal junction trees

UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
An empirical study of w-cutset sampling for bayesian networks

UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Approximate Decomposition: a method for bounding and estimating probabilistic and deterministic queries

UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence

Improving Bound Propagation

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Active tuples-based scheme for bounding posterior beliefs

Journal of Artificial Intelligence Research
A hybrid factored frontier algorithm for dynamic Bayesian network models of biopathways

Proceedings of the 9th International Conference on Computational Methods in Systems Biology
A Hybrid Factored Frontier Algorithm for Dynamic Bayesian Networks with a Biopathways Application

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an any-time scheme for computing lower and upper bounds on posterior marginals in Bayesian networks. The scheme draws from two previously proposed methods, bounded conditioning (Horvitz, Suermondt, & Cooper 1989) and bound propagation (Leisink & Kappen 2003). Following the principles of cutset conditioning (Pearl 1988), our method enumerates a subset of cutset tuples and applies exact reasoning in the network instances conditioned on those tuples. The probability mass of the remaining tuples is bounded using a variant of bound propagation. We show that our new scheme improves on the earlier schemes.