Inference in Bayesian Networks with Recursive Probability Trees: Data Structure Definition and Operations

Recursive probability trees (RPTs) are a data structure for representing several types of potentials involved in probabilistic graphical models. The RPT structure improves the modeling capabilities of previous structures (like probability trees or conditional probability tables). These capabilities can be exploited to gain savings in memory space and/or computation time during inference. This paper describes the modeling capabilities of RPTs as well as how the basic operations required for making inference on Bayesian networks operate on them. The performance of the inference process with RPTs is examined with some experiments using the variable elimination algorithm.

[1]  Jürg Kohlas,et al.  Algorithms for uncertainty and defeasible reasoning , 2000 .

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

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

[4]  Serafín Moral,et al.  Factorisation of Probability Trees and its Application to Inference in Bayesian Networks , 2002, Probabilistic Graphical Models.

[5]  Serafín Moral,et al.  Approximate Factorisation of Probability Trees , 2005, ECSQARU.

[6]  Serafín Moral,et al.  Recursive Probability Trees for Bayesian Networks , 2009, CAEPIA.

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

[8]  K. Kristensen,et al.  A DECISION SUPPORT SYSTEM FOR MECHANICAL WEED CONTROL IN MALTING BARLEY , 1997 .

[9]  Irene Martínez,et al.  Dynamic importance sampling in Bayesian networks using factorisation of probability trees , 2006, Probabilistic Graphical Models.

[10]  David Heckerman,et al.  Knowledge Representation and Inference in Similarity Networks and Bayesian Multinets , 1996, Artif. Intell..

[11]  Kristian Kristensen,et al.  The use of a Bayesian network in the design of a decision support system for growing malting barley without use of pesticides , 2002 .

[12]  Rina Dechter,et al.  A Scheme for Approximating Probabilistic Inference , 1997, UAI.

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

[14]  Anders L. Madsen,et al.  Improvements to message computation in lazy propagation , 2010, Int. J. Approx. Reason..

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

[16]  Craig Boutilier,et al.  Context-Specific Independence in Bayesian Networks , 1996, UAI.

[17]  Prakash P. Shenoy,et al.  Computation in Valuation Algebras , 2000 .

[18]  Antonio Salmerón,et al.  Fast Factorisation of Probabilistic Potentials and its Application to Approximate Inference in Bayesian Networks , 2012, Int. J. Uncertain. Fuzziness Knowl. Based Syst..