Exploiting Dynamic Independence in a Static Conditioning Graph

Abstract. A conditioning graph (CG) is a graphical structure that attempt to minimize the implementation overhead of computing probabilities in belief networks. A conditioning graph recursively factorizes the network, but restricting each decomposition to a single node allows us to store the structure with minimal overhead, and compute with a simple algorithm. This paper extends conditioning graphs with optimizations that effectively reduce the height of the CG, thus reducing time complexity exponentially, while increasing the storage requirements by only a constant factor. We conclude that CGs are frequently as efficient as any other exact inference method, with the advantage of being vastly superior to VE and JT in terms of space complexity, and far simpler to implement.

• Type: Conference
• Year: 2006
• Where: AI
• Authors: Kevin Grant, Michael C. Horsch
• Keywords: AI 2006, Artificial Intelligence, Conditioning Graphs, Exact Inference Method, Implementation Overhead