Belief update in CLG Bayesian networks with lazy propagation
International Journal of Approximate Reasoning
Performance Evaluation of Algorithms for Soft Evidential Update in Bayesian Networks: First Results
SUM '08 Proceedings of the 2nd international conference on Scalable Uncertainty Management
A simple graphical approach for understanding probabilistic inference in Bayesian networks
Information Sciences: an International Journal
Arc reversals in hybrid Bayesian networks with deterministic variables
International Journal of Approximate Reasoning
Improvements to message computation in lazy propagation
International Journal of Approximate Reasoning
Variable elimination for influence diagrams with super value nodes
International Journal of Approximate Reasoning
Join tree propagation utilizing both arc reversal and variable elimination
International Journal of Approximate Reasoning
Using four cost measures to determine arc reversal orderings
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
Evaluating probabilistic inference techniques: a question of "When," not "Which"
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
Ordering arc-reversal operations when eliminating variables in lazy AR propagation
International Journal of Approximate Reasoning
On the tree structure used by lazy propagation for inference in bayesian networks
ECSQARU'13 Proceedings of the 12th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
| Hi-index | 0.00 |
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.