Sciweavers

Share
AI
2006
Springer

Exploiting Dynamic Independence in a Static Conditioning Graph

10 years 6 months ago
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.
Kevin Grant, Michael C. Horsch
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2006
Where AI
Authors Kevin Grant, Michael C. Horsch
Comments (0)
books