Inside-Outside Probability Computation for Belief Propagation

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.

• Type: Conference
• Year: 2007
• Where: IJCAI
• Authors: Taisuke Sato
• Keywords: Artificial Intelligence, Hidden Markov Models, IJCAI 2007, Inside-outside Probability Computation, Junction Trees