Reduction of Computational Complexity in Bayesian Networks Through Removal of Weak Dependences
Abstract
The paper presents a method for reducing the computational complexity of Bayesian networks through identification and removal of weak dependencies (removal of links from the (moralized) independence graph). The removal of a small number of links may reduce the computational complexity dramatically, since several fill-ins and moral links may be rendered superfluous by the removal. The method is described in terms of impact on the independence graph, the junction tree, and the potential functions associated with these. An empirical evaluation of the method using large real-world networks demonstrates the applicability of the method. Further, the method, which has been implemented in Hugin, complements the approximation method suggested by Jensen & Andersen (1990).
Cite
Text
Kjærulff. "Reduction of Computational Complexity in Bayesian Networks Through Removal of Weak Dependences." Conference on Uncertainty in Artificial Intelligence, 1994. doi:10.1016/B978-1-55860-332-5.50052-3Markdown
[Kjærulff. "Reduction of Computational Complexity in Bayesian Networks Through Removal of Weak Dependences." Conference on Uncertainty in Artificial Intelligence, 1994.](https://mlanthology.org/uai/1994/kjrulff1994uai-reduction/) doi:10.1016/B978-1-55860-332-5.50052-3BibTeX
@inproceedings{kjrulff1994uai-reduction,
title = {{Reduction of Computational Complexity in Bayesian Networks Through Removal of Weak Dependences}},
author = {Kjærulff, Uffe},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {1994},
pages = {374-382},
doi = {10.1016/B978-1-55860-332-5.50052-3},
url = {https://mlanthology.org/uai/1994/kjrulff1994uai-reduction/}
}