Approximate probability propagation with mixtures of truncated exponentials

Mixtures of truncated exponentials (MTEs) are a powerful alternative to discretisation when working with hybrid Bayesian networks. One of the features of the MTE model is that standard propagation algorithms can be used. However, the complexity of the process is too high and therefore approximate methods, which tradeoff complexity for accuracy, become necessary. In this paper we propose an approximate propagation algorithm for MTE networks which is based on the Penniless propagation method already known for discrete variables. We also consider how to use Markov Chain Monte Carlo to carry out the probability propagation. The performance of the proposed methods is analysed in a series of experiments with random networks.

[1]  Serafín Moral,et al.  Penniless propagation in join trees , 2000, Int. J. Intell. Syst..

[2]  Steffen L. Lauritzen,et al.  Bayesian updating in causal probabilistic networks by local computations , 1990 .

[3]  Xiao-Ping Zhang,et al.  Advances in Intelligent Computing, International Conference on Intelligent Computing, ICIC 2005, Hefei, China, August 23-26, 2005, Proceedings, Part I , 2005, ICIC.

[4]  R. A. Leibler,et al.  On Information and Sufficiency , 1951 .

[5]  Serafín Moral,et al.  Heuristic Algorithms for the Triangulation of Graphs , 1994, IPMU.

[6]  Andrew P. Sage,et al.  Uncertainty in Artificial Intelligence , 1987, IEEE Transactions on Systems, Man, and Cybernetics.

[7]  J. Hammersley.  SIMULATION AND THE MONTE CARLO METHOD , 1982 .

[8]  Kristian G. Olesen,et al.  Causal Probabilistic Networks with Both Discrete and Continuous Variables , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Uffe Kjærulff.  Optimal decomposition of probabilistic networks by simulated annealing , 1992 .

[10]  Serafín Moral,et al.  Estimating Mixtures of Truncated Exponentials from Data , 2002, Probabilistic Graphical Models.

[11]  Nicos Christofides,et al.  The optimal discretization of probability density functions , 1999 .

[12]  Serafín Moral,et al.  Lazy evaluation in penniless propagation over join trees , 2002, Networks.

[13]  Dragomir Anguelov,et al.  A General Algorithm for Approximate Inference and Its Application to Hybrid Bayes Nets , 1999, UAI.

[14]  A. Salmerón,et al.  Importance sampling in Bayesian networks using probability trees , 2000 .

[15]  Serafín Moral,et al.  Mixtures of Truncated Exponentials in Hybrid Bayesian Networks , 2001, ECSQARU.

[16]  Allan J. Macleod,et al.  Performance evaluation of normal distribution software , 1992 .

[17]  Frank Jensen,et al.  Approximations in Bayesian Belief Universe for Knowledge Based Systems , 2013, UAI 1990.

[18]  Daphne Koller,et al.  Nonuniform Dynamic Discretization in Hybrid Networks , 1997, UAI.

[19]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[20]  A. Matteis,et al.  A Note on Sampling from Combinations of Distributions , 1971 .

[21]  Prakash P. Shenoy,et al.  Approximating Probability Density Functions with Mixtures of Truncated Exponentials , 2004 .

[22]  Eugene Santos,et al.  Hybrid algorithms for approximate belief updating in Bayes nets , 1997, Int. J. Approx. Reason..

[23]  Prakash P. Shenoy,et al.  Axioms for probability and belief-function proagation , 1990, UAI.

[24]  Serafín Moral,et al.  Novel strategies to approximate probability trees in penniless propagation , 2003, Int. J. Intell. Syst..

[25]  David J. Spiegelhalter,et al.  Local computations with probabilities on graphical structures and their application to expert systems , 1990 .

[26]  S. Lauritzen.  Propagation of Probabilities, Means, and Variances in Mixed Graphical Association Models , 1992 .

[27]  Anders L. Madsen,et al.  LAZY Propagation: A Junction Tree Inference Algorithm Based on Lazy Evaluation , 1999, Artif. Intell..