On the Optimality of Solutions of the Max-Product Belief Propagation Algorithm in Arbitrary Graphs (2001)
by
Yair Weiss
,
William T. Freeman
| Citations: | 130 - 15 self |
BibTeX
@MISC{Weiss01onthe,
author = {Yair Weiss and William T. Freeman},
title = {On the Optimality of Solutions of the Max-Product Belief Propagation Algorithm in Arbitrary Graphs},
year = {2001}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Graphical models, suchasBayesian networks and Markov random fields, represent statistical dependencies of variables by a graph. The max-product "belief propagation" algorithm is a local-message passing algorithm on this graph that is known to converge to a unique fixed point when the graph is a tree. Furthermore, when the graph is a tree, the assignment based on the fixed-point yields the most probable a posteriori (MAP) values of the unobserved variables given the observed ones. Recently, good
