Lazy Evaluation in Penniless Propagation over Join Trees

Lazy Evaluation in Penniless Propagation over Join Trees (2000)

Cached

Download Links

[decsai.ugr.es]

Other Repositories/Bibliography

DBLP

by Andrés Cano , Serafín Moral , Antonio Salmerón

Citations:

3 - 1 self

BibTeX

@MISC{Cano00lazyevaluation,
    author = {Andrés Cano and Serafín Moral and Antonio Salmerón},
    title = {Lazy Evaluation in Penniless Propagation over Join Trees},
    year = {2000}
}

Bookmark

OpenURL

Abstract

In this paper, we investigate the application of the ideas behind Lazy propagation to the Penniless propagation scheme. In addition to the use of probability trees to represent and approximate potentials, both in the messages and in the nodes of the join tree, those potentials are not combined to obtain the joint potential over a node of the join tree or over a message. Rather, those joint potentials are represented in a factorized way, and the combinations are postponed until they are compulsory for the deletion of a variable. Here we test two variations of the basic Lazy scheme. One is based in keeping a hash table of combined potentials so that computations are not repeated. The other one consists in using heuristics to determine an order of combination of a list of potentials.

Citations

5662	Probabilistic reasoning in intelligent systems: networks of plausible inference - Pearl - 1988
1080	Local computations with probabilities on graphical structures and their application to expert systems (with discussion - Lauritzen, Spiegelhalter - 1988
719	FV: An Introduction to Bayesian Networks - Jensen - 1996
240	Bayesian updating in causal probabilistic networks by local computations - Jensen, Lauritzen, et al. - 1990
142	Simulation approaches to general probabilistic inference on belief networks - Shachter, Peot - 1989
114	An algebra of bayesian belief universes for knowledge based systems, Networks 20 - Jensen, Olesen, et al. - 1990
86	Weighting and integrating evidence for stochastic simulation in Bayesian networks - FUNG, CHANG - 1990
47	Nonuniform dynamic discretization in hybrid networks - Kozlov, Koller - 1997
47	Axioms for probability and belief function propagation - Shenoy, Shafer - 1990
40	An optimal approximation algorithm for bayesian inference - Dagum, Luby - 1997
37	On information and suciency - Kullback, Leibler - 1951
32	Lazy Propagation: A Junction Tree Inference Algorithm Based on Lazy Evaluation - Madsen, Jensen - 1999
31	Binary join trees for computing marginals in the Shenoy-Shafer architecture - Shenoy - 1997
30	Blocking Gibbs sampling in very large probabilistic expert systems - Jensen, Kong, et al. - 1995
26	Average-case analysis of a search algorithm for estimating prior and posterior probabilities in Bayesian networks with extreme probabilities - Poole - 1993
17	A Monte Carlo algorithm for probabilistic propagation in belief networks based on importance sampling and strati ed simulation techniques - Hernandez, Moral, et al. - 1998
15	Importance sampling in bayesian networks using probability trees - Salmerón, Cano, et al.
14	Penniless propagation in join trees - Cano, Moral, et al. - 2000
13	Hybrid algorithms for approximate belief updating in bayes nets - Santos, Shimony, et al.
12	Contextspeci c independence in bayesian networks - Boutilier, Friedman, et al. - 1996
12	Belief updating by enumerating high-probability independence-based assignments - Santos, Shimony - 1994
11	Importance sampling algorithms for the propagation of probabilities in belief networks - Cano, Hernandez, et al. - 1996
10	Heuristic algorithms for the triangulation of graphs, in - Cano, Moral - 1994
9	An accurate approximation to the sampling distribution of the studentized extreme-valued statistic - Fertig, Mann - 1980
8	A modified simulation scheme for inference in Bayesian networks - Bouckaert, Castillo, et al. - 1996
7	Optimal decomposition of probabilistic networks by simulated annealing - Kjrul - 1992
4	Propagacion exacta y aproximada con arboles de probabilidad. In: Actas de la VII Conferencia de la Asociacion Española para la Inteligencia Arti cial - Cano, Moral - 1997
2	Reduction of computational complexity in Bayesian networks through removal of weak dependences - Kjrul - 1994
2	Efficient Inference in Bayesian Networks - Kozlov - 1998
1	Lazy propagation and independence of causal in - Madsen, D'Ambrosio - 1999