Download:
|
by Daphne Koller, Uri Lerner, Dragomir Angelov
In UAI 15
http://robotics.stanford.edu/~koller/papers/uai99kla.ps
Add To MetaCart
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. 1
Citations
|
4364
|
Elements of Information Theory
– Cover, Thomas
- 1991
|
|
4344
|
Maximum likelihood from incomplete data via the EM algorithm
– Dempster, Laird, et al.
- 1977
|
|
3051
|
Neural Networks for Pattern Recognition
– Bishop
- 1995
|
|
904
|
Local computations with probabilities on graphical structures and their applications to expert systems
– Lauritzen, Spiegelhalter
- 1988
|
|
447
|
Contour tracking by stochastic propagation of conditional density
– Isard, Blake
- 1996
|
|
323
|
Probabilistic inference using Markov Chain Monte Carlo methods
– Neal
- 1993
|
|
275
|
Evaluating influence diagrams
– Shachter
- 1986
|
|
134
|
Stochastic simulation algorithms for dynamic probabilistic networks
– Kanazawa, Koller, et al.
- 1995
|
|
125
|
Simulation approaches to general probabilistic inference on belief networks
– Shachter, Peot
- 1989
|
|
114
|
Bayesian updating in recursive graphical models by local computations. Computational Statisticals Quarterly
– Jensen, Lauritzen, et al.
- 1990
|
|
109
|
Propagation of probabilities, means, and variances in mixed graphical association models
– Lauritzen
- 1992
|
|
93
|
Axioms for probability and belief-function propagation
– SHENOY, G
- 1988
|
|
74
|
The BATmobile: Towards a Bayesian automated taxi
– Forbes, Huang, et al.
- 1995
|
|
52
|
Using learning for approximation in stochastic processes
– Koller, Fratkina
- 1998
|
|
48
|
Automatic symbolic traffic scene analysis using belief networks
– Huang, Koller, et al.
- 1994
|
|
35
|
Nonuniform dynamic discretization in hybrid networks
– Kozlov, Koller
- 1997
|
|
15
|
Hybrid propagation in junction trees
– Dawid, Kjærulff, et al.
- 1995
|
|
8
|
Hugs: Combining exact inference and gibbs sampling in junction trees
– Kjærulff
- 1995
|
|
5
|
Mixing exact and importance sampling propagation algorithms in dependence graphs
– Hernandez, Moral
- 1997
|
|
3
|
Computing upper and lower bound on likelihoods in intractable networks
– Jaakola, Jordan
- 1996
|
|
2
|
HUGS: Combining exact inference and Gibbs sampling in junction trees
– Kjrulff
- 1995
|
