A Combination of Cutset Conditioning with Clique-Tree Propagation in the Pathfinder System

03/27/2013
by   Jaap Suermondt, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

page 5

page 6

page 7

research
02/06/2013

Independence of Causal Influence and Clique Tree Propagation

This paper explores the role of independence of causal influence (ICI) i...
research
01/23/2013

A General Algorithm for Approximate Inference and its Application to Hybrid Bayes Nets

The clique tree algorithm is the standard method for doing inference in ...
research
03/13/2013

Reformulating Inference Problems Through Selective Conditioning

We describe how we selectively reformulate portions of a belief network ...
research
08/23/2017

Bayesian Learning of Clique Tree Structure

The problem of categorical data analysis in high dimensions is considere...
research
02/24/2022

IBIA: Bayesian Inference via Incremental Build-Infer-Approximate operations on Clique Trees

Exact inference in Bayesian networks is intractable and has an exponenti...
research
06/01/2023

Approximate inference of marginals using the IBIA framework

Exact inference of marginals in probabilistic graphical models (PGM) is ...
research
02/06/2013

Nested Junction Trees

The efficiency of inference in both the Hugin and, most notably, the Sha...

Please sign up or login with your details

Forgot password? Click here to reset