A general algorithm for approximate inference and its application to hybrid bayes nets

Authors:
Daphne Koller;Uri Lerner;Dragomir Angelov
Affiliations:
Computer Science Dept., Stanford University;Computer Science Dept., Stanford University;Computer Science Dept., Stanford University
Venue:
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Year:
1999

Citing 14
Cited 31

Gaussian influence diagrams

Management Science
Elements of information theory

Elements of information theory
Automatic symbolic traffic scene analysis using belief networks

AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Neural Networks for Pattern Recognition

Neural Networks for Pattern Recognition
Contour Tracking by Stochastic Propagation of Conditional Density

ECCV '96 Proceedings of the 4th European Conference on Computer Vision-Volume I - Volume I
Using Learning for Approximation in Stochastic Processes

ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
Simulation Approaches to General Probabilistic Inference on Belief Networks

UAI '89 Proceedings of the Fifth Annual Conference on Uncertainty in Artificial Intelligence
Hybrid Propagation in Junction Trees

IPMU'94 Selected papers from the 5th International Conference on Processing and Management of Uncertainty in Knowledge-Based Systems, Advances in Intelligent Computing
Axioms for probability and belief-function proagation

UAI '88 Proceedings of the Fourth Annual Conference on Uncertainty in Artificial Intelligence
The BATmobile: towards a Bayesian automated taxi

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Stochastic simulation algorithms for dynamic probabilistic networks

UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
HUGS: combining exact inference and Gibbs sampling in junction trees

UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Nonuniform dynamic discretization in hybrid networks

UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
Computing upper and lower bounds on likelihoods in intractable networks

UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence

Using Bayesian networks to analyze expression data

RECOMB '00 Proceedings of the fourth annual international conference on Computational molecular biology
Mixtures of Truncated Exponentials in Hybrid Bayesian Networks

ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
A General Algorithm for Approximate Inference in Multiply Sectioned Bayesian Networks

IDA '01 Proceedings of the 4th International Conference on Advances in Intelligent Data Analysis
Tree approximation for belief updating

Eighteenth national conference on Artificial intelligence
Nonparametric belief propagation for self-calibration in sensor networks

Proceedings of the 3rd international symposium on Information processing in sensor networks
Predicting software defects in varying development lifecycles using Bayesian nets

Information and Software Technology
Approximate probability propagation with mixtures of truncated exponentials

International Journal of Approximate Reasoning
Inference in hybrid Bayesian networks using dynamic discretization

Statistics and Computing
A common coordinates/heading direction generation method for wirelessly networked robots with only ranging capability

Proceedings of the 1st international conference on Robot communication and coordination
Efficient belief propagation for higher-order cliques using linear constraint nodes

Computer Vision and Image Understanding
A common coordinates/heading direction generation method for a robot swarm with only RSSI-based ranging

EURASIP Journal on Advances in Signal Processing - Special issue on signal processing advances in robots and autonomy
Generalized evidence pre-propagated importance sampling for hybrid Bayesian networks

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Cutset sampling for Bayesian networks

Journal of Artificial Intelligence Research
Inference in hybrid Bayesian networks with mixtures of truncated exponentials

International Journal of Approximate Reasoning
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
Distributed inference for network localization using radio interferometric ranging

EWSN'08 Proceedings of the 5th European conference on Wireless sensor networks
Particle-based belief propagation for structure from motion and dense stereo vision with unknown camera constraints

RobVis'08 Proceedings of the 2nd international conference on Robot vision
Nonparametric belief propagation

Communications of the ACM
Nonparametric belief propagation

CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
PAMPAS: real-valued graphical models for computer vision

CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Simultaneous Motion Detection and Background Reconstruction with a Conditional Mixed-State Markov Random Field

International Journal of Computer Vision
Text classification for data loss prevention

PETS'11 Proceedings of the 11th international conference on Privacy enhancing technologies
Mix-nets: factored mixtures of Gaussians in Bayesian networks with mixed continuous and discrete variables

UAI'00 Proceedings of the Sixteenth conference on Uncertainty in artificial intelligence
Exact inference in networks with discrete children of continuous parents

UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Expectation propagation for approximate Bayesian inference

UAI'01 Proceedings of the Seventeenth 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
Harmony Potentials

International Journal of Computer Vision
Penniless propagation with mixtures of truncated exponentials

ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Short communication: On estimating simple probabilistic discriminative models with subclasses

Expert Systems with Applications: An International Journal
Loose-limbed People: Estimating 3D Human Pose and Motion Using Non-parametric Belief Propagation

International Journal of Computer Vision
Continuous markov random fields for robust stereo estimation

ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part V

Quantified Score

Hi-index	0.02

Visualization

Abstract

The clique tree algorithm is the standard method for doing inference in Bayesian networks. It works by manipulating clique potentials - distributions over the variables in a clique. While this approach works well for many networks, it is limited by the need to maintain an exact representation of the clique potentials. This paper presents a new unified approach that combines approximate inference and the clique tree algorithm, thereby circumventing this limitation. Many known approximate inference algorithms can be viewed as instances of this approach. The algorithm essentially does clique tree propagation, using approximate inference to estimate the densities in each clique. In many settings, the computation of the approximate clique potential can be done easily using statistical importance sampling. Iterations are used to gradually improve the quality of the estimation.