title: Variations over the message computation algorithm of lazy propagation.
abstract: Improving the performance of belief updating becomes increasingly important as real-world Bayesian networks continue to grow larger and more complex. In this paper, an investigation is done on how variations over the message-computation algorithm of lazy propagation may impact its performance. Lazy propagation is a junction-tree-based inference algorithm for belief updating in Bayesian networks. Lazy propagation combines variable elimination (VE) with a Shenoy-Shafer message-passing scheme in an attempt to exploit the independence properties induced by evidence in a junction-tree-based algorithm. The authors investigate, the use of arc reversal (AR) and symbolic probabilistic inference (SPI) as alternative algorithms for computing clique-to-clique messages in lazy propagation. The paper presents the results of an empirical evaluation of the performance of lazy propagation using AR, SPI, and VE as the message-computation algorithm. The results of the empirical evaluation show that no single algorithm outperforms or is outperformed by the other two alternatives. In many cases, there is no significant difference in the performance of the three algorithms.
authors.affiliation: HUGIN Expert A/S, Aalborg, Denmark. Anders.L.Madsen@hugin.com
authors.forename: Anders L
authors.initials: AL
authors.lastname: Madsen
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D001499:Bayes Theorem; D003198:Computer Simulation; D003661:Decision Support Techniques; D015233:Models, Statistical; D010363:Pattern Recognition, Automated / Q000379:methods*