Efficient indexing methods for recursive decompositions of Bayesian networks

We consider efficient indexing methods for conditioning graphs, which are a form of recursive decomposition for Bayesian networks. We compare two well-known methods for indexing, a top-down method and a bottom-up method, and discuss the redundancy that each of these suffer from. We present a new method for indexing that combines the advantages of each model in order to reduce this redundancy. We also introduce the concept of an update manager, which is a node in the conditioning graph that controls when other nodes update their current index. Empirical evaluations over a suite of standard test networks show a considerable reduction both in the amount of indexing computation that takes place, and the overall runtime required by the query algorithm.

[1]  Adnan Darwiche,et al.  Recursive conditioning , 2001, Artif. Intell..

[2]  Adnan Darwiche,et al.  Inference in belief networks: A procedural guide , 1996, Int. J. Approx. Reason..

[3]  Nir Friedman,et al.  Probabilistic Graphical Models - Principles and Techniques , 2009 .

[4]  Kevin Grant,et al.  Conditioning Graphs: Practical Structures for Inference in Bayesian Networks , 2005, Australian Conference on Artificial Intelligence.

[5]  Rina Dechter,et al.  Topological parameters for time-space tradeoff , 1996, Artif. Intell..

[6]  Gregory F. Cooper,et al.  The Computational Complexity of Probabilistic Inference Using Bayesian Belief Networks , 1990, Artif. Intell..

[7]  Dan Geiger,et al.  Maximum Likelihood Haplotyping for General Pedigrees , 2005, Human Heredity.

[8]  Fabio Gagliardi Cozman,et al.  Anytime anyspace probabilistic inference , 2004, Int. J. Approx. Reason..

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

[10]  Gregory M. Provan,et al.  A Standard Approach for Optimizing Belief Network Inference Using Query DAGs , 1997, UAI.

[11]  Nevin L. Zhang,et al.  A simple approach to Bayesian network computations , 1994 .

[12]  Kevin Grant,et al.  Methods for constructing balanced elimination trees and other recursive decompositions , 2006, Int. J. Approx. Reason..

[13]  F. J. Díez,et al.  Operating with potentials of discrete variables , 2007, Int. J. Approx. Reason..