Methods for Constructing Balanced Elimination Trees and Other Recursive Decompositions

Abstract

A conditioning graph is a form of recursive factorization which minimizes the memory requirements and simplifies the implementation of inference in Bayesian networks. The time complexity for inference in conditioning graphs has been shown to be O(n exp(d)), where d is the depth of the underlying elimination tree. We demonstrate in this paper techniques for… (More)
DOI: 10.1016/j.ijar.2009.04.010

9 Figures and Tables

Topics

  • Presentations referencing similar topics