Difference between revisions of "Forward-Backward"
From Cohen Courses
Jump to navigationJump to search| Line 1: | Line 1: | ||
== Summary == | == Summary == | ||
| − | This is a dynamic programming [[Category::method | algorithm]], used in [[AddressesProblem::Hidden Markov Models]] to efficiently compute the posterior marginals over all the hidden state variables | + | This is a dynamic programming [[Category::method | algorithm]], used in [[AddressesProblem::Hidden Markov Models]] to efficiently compute the posterior marginals over all the hidden state variables. |
| − | |||
| − | |||
| − | |||
| − | |||
Revision as of 14:56, 28 September 2011
Summary
This is a dynamic programming algorithm, used in Hidden Markov Models to efficiently compute the posterior marginals over all the hidden state variables.
