Updating Probabilities in Multiply-Connected Belief Networks

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

This paper focuses on probability updates in multiply-connected belief networks. Pearl has designed the method of conditioning, which enables us to apply his algorithm for belief updates in singly-connected networks to multiply-connected belief networks by selecting a loop-cutset for the network and instantiating these loop-cutset nodes. We discuss conditions that need to be satisfied by the selected nodes. We present a heuristic algorithm for finding a loop-cutset that satisfies these conditions.

READ FULL TEXT

page 1

page 2

page 3

page 4

page 5

page 6

page 7

page 8

research
03/27/2013

On Heuristics for Finding Loop Cutsets in Multiply-Connected Belief Networks

We introduce a new heuristic algorithm for the problem of finding minimu...
research
03/06/2013

An efficient approach for finding the MPE in belief networks

Given a belief network with evidence, the task of finding the I most pro...
research
03/27/2013

An Axiomatic Framework for Belief Updates

In the 1940's, a physicist named Cox provided the first formal justifica...
research
03/27/2013

Distributed Revision of Belief Commitment in Multi-Hypothesis Interpretations

This paper extends the applications of belief-networks to include the re...
research
03/27/2013

A New Algorithm for Finding MAP Assignments to Belief Networks

We present a new algorithm for finding maximum a-posterior) (MAP) assign...
research
02/27/2013

Global Conditioning for Probabilistic Inference in Belief Networks

In this paper we propose a new approach to probabilistic inference on be...
research
02/27/2013

Belief Updating by Enumerating High-Probability Independence-Based Assignments

Independence-based (IB) assignments to Bayesian belief networks were ori...

Please sign up or login with your details

Forgot password? Click here to reset