Difference between revisions of "Forward-Backward"
From Cohen Courses
Jump to navigationJump to search| Line 2: | Line 2: | ||
This is a dynamic programming [[Category::method | algorithm]], used in [[AddressesProblem::Hidden Markov Model | 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 Model | Hidden Markov Models]] to efficiently compute the posterior marginals over all the hidden state variables. | ||
| + | |||
| + | These values are then used in Posterior Decoding, which simply chooses the state with the highest posterior marginal for each position in the sequence. | ||
Revision as of 15:16, 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.
These values are then used in Posterior Decoding, which simply chooses the state with the highest posterior marginal for each position in the sequence.
