Artificial Intelligence
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Initialization for the method of conditioning in Bayesian belief networks
Artificial Intelligence
Decision Support Systems - Special issue on logic modeling
On the hardness of approximate reasoning
Artificial Intelligence
Measures of uncertainty in expert systems
Artificial Intelligence
2U: an exact interval propagation algorithm for polytrees with binary variables
Artificial Intelligence
An Introduction to Variational Methods for Graphical Models
Machine Learning
Artificial Intelligence
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Introduction to Bayesian Networks
Introduction to Bayesian Networks
Probabilistic Networks and Expert Systems
Probabilistic Networks and Expert Systems
Weighing and Integrating Evidence for Stochastic Simulation in Bayesian Networks
UAI '89 Proceedings of the Fifth Annual Conference on Uncertainty in Artificial Intelligence
UAI '00 Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
Separation Properties of Sets of Probability Measures
UAI '00 Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
Localized partial evaluation of belief networks
Localized partial evaluation of belief networks
Reasoning about Uncertainty
Learning Bayesian Networks
Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks
International Journal of Approximate Reasoning
Binarization Algorithms for Approximate Updating in Credal Nets
Proceedings of the 2006 conference on STAIRS 2006: Proceedings of the Third Starting AI Researchers' Symposium
Mean field theory for sigmoid belief networks
Journal of Artificial Intelligence Research
The inferential complexity of Bayesian and credal networks
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Graphical models for imprecise probabilities
International Journal of Approximate Reasoning
Inference in credal networks: branch-and-bound methods and the A/R+ algorithm
International Journal of Approximate Reasoning
Loopy belief propagation for approximate inference: an empirical study
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Loopy belief propagation and Gibbs measures
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Bucket elimination: a unifying framework for probabilistic inference
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Theoretical foundations for abstraction-based probabilistic planning
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Inference in polytrees with sets of probabilities
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Turbo decoding as an instance of Pearl's “belief propagation” algorithm
IEEE Journal on Selected Areas in Communications
Loopy Propagation in a Probabilistic Description Logic
SUM '08 Proceedings of the 2nd international conference on Scalable Uncertainty Management
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
| Hi-index | 0.00 |
This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contain only binary variables. Such networks can represent incomplete or vague beliefs, lack of data, and disagreements among experts; they can also encode models based on belief functions and possibilistic measures. All algorithms for approximate inference in this paper rely on exact inferences in credal networks based on polytrees with binary variables, as these inferences have polynomial complexity. We are inspired by approximate algorithms for Bayesian networks; thus the Loopy 2U algorithm resembles Loopy Belief Propagation, while the Iterated Partial Evaluation and Structured Variational 2U algorithms are, respectively, based on Localized Partial Evaluation and variational techniques.