Talk:Belief propagation

From Wikipedia, the free encyclopedia

The use of factor graphs in the description of the algorithm seems weaker than the approach taken by Yedidia et al in [1]. At least the one taken here is less clear.

In fact, factor graphs are more general than pairwise Markov random fields, the model used by Yedidia in the technical report to which you make reference. For instance, see a more recent technical report by Yedidia et al. in [2]. It's also not hard to see how belief propagation in the pairwise MRF setting can be converted to BP in the factor graph setting. Ikcotyck 01:50, 26 July 2005 (UTC)

What is this article by Lauritzen and Spiegelhalter in 1986? I only know of one in 1988 called "Local Computation with Probabilities in Graphical Structures and Their Applications to Expert Systems"

Hmm.. That's the article I know as well, I can't remember why I put 1986. Ikcotyck