Belief Updating by Enumerating High-Probability Independence-Based Assignments

02/27/2013
by   Eugene Santos Jr, et al.
0

Independence-based (IB) assignments to Bayesian belief networks were originally proposed as abductive explanations. IB assignments assign fewer variables in abductive explanations than do schemes assigning values to all evidentially supported variables. We use IB assignments to approximate marginal probabilities in Bayesian belief networks. Recent work in belief updating for Bayes networks attempts to approximate posterior probabilities by finding a small number of the highest probability complete (or perhaps evidentially supported) assignments. Under certain assumptions, the probability mass in the union of these assignments is sufficient to obtain a good approximation. Such methods are especially useful for highly-connected networks, where the maximum clique size or the cutset size make the standard algorithms intractable. Since IB assignments contain fewer assigned variables, the probability mass in each assignment is greater than in the respective complete assignment. Thus, fewer IB assignments are sufficient, and a good approximation can be obtained more efficiently. IB assignments can be used for efficiently approximating posterior node probabilities even in cases which do not obey the rather strict skewness assumptions used in previous research. Two algorithms for finding the high probability IB assignments are suggested: one by doing a best-first heuristic search, and another by special-purpose integer linear programming. Experimental results show that this approach is feasible for highly connected belief networks.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

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...
03/06/2013

Relevant Explanations: Allowing Disjunctive Assignments

Relevance-based explanation is a scheme in which partial assignments to ...
06/04/2022

MPE inference using an Incremental Build-Infer-Approximate Paradigm

Exact inference of the most probable explanation (MPE) in Bayesian netwo...
03/06/2013

Belief Revision in Probability Theory

In a probability-based reasoning system, Bayes' theorem and its variatio...
03/27/2013

Updating Probabilities in Multiply-Connected Belief Networks

This paper focuses on probability updates in multiply-connected belief n...
01/28/2021

A Bayesian Model of Cash Bail Decisions

The use of cash bail as a mechanism for detaining defendants pre-trial i...
02/27/2013

Properties of Bayesian Belief Network Learning Algorithms

Bayesian belief network learning algorithms have three basic components:...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.