Efficient Search-Based Inference for Noisy-OR Belief Networks: TopEpsilon

02/13/2013
by   Kurt Huang, et al.
0

Inference algorithms for arbitrary belief networks are impractical for large, complex belief networks. Inference algorithms for specialized classes of belief networks have been shown to be more efficient. In this paper, we present a search-based algorithm for approximate inference on arbitrary, noisy-OR belief networks, generalizing earlier work on search-based inference for two-level, noisy-OR belief networks. Initial experimental results appear promising.

READ FULL TEXT

page 1

page 2

page 3

page 5

page 6

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
02/27/2013

Symbolic Probabilitistic Inference in Large BN2O Networks

A BN2O network is a two level belief net in which the parent interaction...
research
03/06/2013

Minimal Assumption Distribution Propagation in Belief Networks

As belief networks are used to model increasingly complex situations, th...
research
03/06/2013

GALGO: A Genetic ALGOrithm Decision Support Tool for Complex Uncertain Systems Modeled with Bayesian Belief Networks

Bayesian belief networks can be used to represent and to reason about co...
research
02/06/2013

A Standard Approach for Optimizing Belief Network Inference using Query DAGs

This paper proposes a novel, algorithm-independent approach to optimizin...
research
03/27/2013

Ideal Reformulation of Belief Networks

The intelligent reformulation or restructuring of a belief network can g...
research
03/06/2013

Additive Belief-Network Models

The inherent intractability of probabilistic inference has hindered the ...

Please sign up or login with your details

Forgot password? Click here to reset