Exploiting case-based independence for approximating marginal probabilities

doi:10.1016/0888-613X(95)00112-T

Exploiting case-based independence for approximating marginal probabilities

1996-01-01

14

PRE

AI

S

Solomon Eyal Shimony *

E

Eugene Santos

DOI：10.1016/0888-613X(95)00112-T

Original

Original request for help

Save

Abstract

En 中文

Computing marginal probabilities in Bayes networks is a hard problem. Deterministic anytime approximation schemes accumulate the probability mass in a small number of value assignments to the network variables. Under certain assumptions, the probability mass in the assignments is sufficient to obtain a good approximation. Such methods are especially useful for highly connected networks, where the topology makes the exact algorithms intractable. Bayes networks often possess a fine independence structure not evident from the topology, but apparent in local conditional distributions Independence-based (IB) assignments, originally proposed as a theory of abduction, take advantage of such independence, and thus contain fewer assigned variables-and more probability mass. We present several algorithms that use IB assignments for approximating marginal probabilities. Experimental results suggest that this approach is feasible for highly connected belief networks.

Keywords:

probabilistic reasoning

Bayesian belief networks

approximate belief updating

approximating marginal probabilities

anytime algorithms

Exploiting case-based independence for approximating marginal probabilities

Abstract

Journal

Organization