A Combination of Cutset Conditioning with Clique-Tree Propagation in the Pathfinder System
Abstract
Cutset conditioning and clique-tree propagation are two popular methods for performing exact probabilistic inference in Bayesian belief networks. Cutset conditioning is based on decomposition of a subset of network nodes, whereas clique-tree propagation depends on aggregation of nodes. We describe a means to combine cutset conditioning and clique- tree propagation in an approach called aggregation after decomposition (AD). We discuss the application of the AD method in the Pathfinder system, a medical expert system that offers assistance with diagnosis in hematopathology.
Cite
Text
Suermondt et al. "A Combination of Cutset Conditioning with Clique-Tree Propagation in the Pathfinder System." Conference on Uncertainty in Artificial Intelligence, 1990.Markdown
[Suermondt et al. "A Combination of Cutset Conditioning with Clique-Tree Propagation in the Pathfinder System." Conference on Uncertainty in Artificial Intelligence, 1990.](https://mlanthology.org/uai/1990/suermondt1990uai-combination/)BibTeX
@inproceedings{suermondt1990uai-combination,
title = {{A Combination of Cutset Conditioning with Clique-Tree Propagation in the Pathfinder System}},
author = {Suermondt, Henri Jacques and Cooper, Gregory F. and Heckerman, David},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {1990},
pages = {245-254},
url = {https://mlanthology.org/uai/1990/suermondt1990uai-combination/}
}