Inside-Outside Probability Computation for Belief Propagation

@inproceedings{citeulike:2157295, abstract = {In this paper we prove that the well-known correspondence between the forward-backward algorithm for hidden Markov models (HMMs) and belief propagation (BP) applied to HMMs can be generalized to one between BP for junction trees and the generalized inside-outside probability computation for probabilistic logic programs applied to junction trees.}, author = {Sato, Taisuke }, citeulike-article-id = {2157295}, keywords = {belief-propagation, machine-learning}, posted-at = {2008-05-07 19:41:33}, priority = {2}, title = {Inside-Outside Probability Computation for Belief Propagation}, url = {http://www.ijcai.org/papers07/Papers/IJCAI07-419.pdf}, year = {2007} }

TY - CONF ID - citeulike:2157295 L3 - citeulike-article-id:2157295 TI - Inside-Outside Probability Computation for Belief Propagation N2 - In this paper we prove that the well-known correspondence between the forward-backward algorithm for hidden Markov models (HMMs) and belief propagation (BP) applied to HMMs can be generalized to one between BP for junction trees and the generalized inside-outside probability computation for probabilistic logic programs applied to junction trees. KW - belief-propagation KW - machine-learning AU - Sato, Taisuke PY - 2007/// UR - http://www.ijcai.org/papers07/Papers/IJCAI07-419.pdf ER -