A Scheme for Approximating Probabilistic Inference

02/06/2013
by   Rina Dechter, et al.
0

This paper describes a class of probabilistic approximation algorithms based on bucket elimination which offer adjustable levels of accuracy and efficiency. We analyze the approximation for several tasks: finding the most probable explanation, belief updating and finding the maximum a posteriori hypothesis. We identify regions of completeness and provide preliminary empirical evaluation on randomly generated networks.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset