AAAI Publications, Twenty-Third International FLAIRS Conference

Font Size: 
Efficient Indexing for Recursive Conditioning Algorithms
Kevin Grant

Last modified: 2010-05-06


In this paper, we consider efficient indexing methods for recursive conditioning algorithms. 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 also present a new method for indexing that is a hybrid of these models. Using this new approach shows an improvement in the amount of indexing operations by 55% or more in our test networks, as well as a reduction in the cumulative time for inference by 33% or more.


Bayesian Networks; conditioning graphs; recursive conditioning

Full Text: PDF