A New Algorithm for Finding MAP Assignments to Belief Networks

Abstract

We present a new algorithm for finding maximum a-posterior) (MAP) assignments of values to belief networks. The belief network is compiled into a network consisting only of nodes with boolean (i.e. only 0 or 1) conditional probabilities. The MAP assignment is then found using a best-first search on the resulting network. We argue that, as one would anticipate, the algorithm is exponential for the general case, but only linear in the size of the network for poly trees.

Appears in Proceedings of the Sixth Conference on Uncertainty in Artificial Intelligence (UAI1990)

Cited by in corpus (4)

• Mini-Bucket Heuristics for Improved Search
• GALGO: A Genetic ALGOrithm Decision Support Tool for Complex Uncertain Systems Modeled with Bayesian Belief Networks
• An efficient approach for finding the MPE in belief networks
• The use of conflicts in searching Bayesian networks