Inside-Outside Probability Computation for Belief Propagation
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.
Cite
Text
Sato. "Inside-Outside Probability Computation for Belief Propagation." International Joint Conference on Artificial Intelligence, 2007.Markdown
[Sato. "Inside-Outside Probability Computation for Belief Propagation." International Joint Conference on Artificial Intelligence, 2007.](https://mlanthology.org/ijcai/2007/sato2007ijcai-inside/)BibTeX
@inproceedings{sato2007ijcai-inside,
title = {{Inside-Outside Probability Computation for Belief Propagation}},
author = {Sato, Taisuke},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2007},
pages = {2605-2610},
url = {https://mlanthology.org/ijcai/2007/sato2007ijcai-inside/}
}