Region Based Approximation for High Dimensional Bayesian Network Models

Abstract

Performing efficient inference on Bayesian Networks (BNs), with large numbers of densely connected variables is challenging. With exact inference methods, such as the Junction Tree algorithm, clustering complexity can grow exponentially with the number of nodes and so computation becomes intractable. This paper presents a general purpose approximate inference algorithm called Triplet Region Construction (TRC) that reduces the clustering complexity for factorized models from worst case exponential to polynomial. We employ graph factorization to reduce connection complexity and produce clusters of limited size. Unlike MCMC algorithms TRC is guaranteed to converge and we present experiments that show that TRC achieves accurate results when compared with exact solutions.

References in corpus (4)

• Loopy Belief Propagation for Approximate Inference: An Empirical Study
• Nonuniform Dynamic Discretization in Hybrid Networks
• A General Algorithm for Approximate Inference and its Application to Hybrid Bayes Nets
• Performing Bayesian Risk Aggregation using Discrete Approximation Algorithms with Graph Factorization