A Combination of Cutset Conditioning with Clique-Tree Propagation in the Pathfinder System
Jaap Suermondt, Gregory F. Cooper, David Heckerman

TL;DR
This paper introduces a novel method called aggregation after decomposition (AD) that combines cutset conditioning with clique-tree propagation to improve probabilistic inference in Bayesian networks, demonstrated within a medical diagnosis system.
Contribution
The paper presents the AD approach, integrating two inference techniques to enhance efficiency and applicability in Bayesian belief networks, specifically in medical expert systems.
Findings
Improved inference efficiency in Bayesian networks
Successful application in a hematopathology diagnosis system
Enhanced accuracy of probabilistic reasoning
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Modeling and Causal Inference · Rough Sets and Fuzzy Logic · Data Management and Algorithms
