Revision as of 04:49, 21 September 2020 edit Citation bot (talk \| contribs) Bots 5,862,576 edits Alter: journal. \| You can use this bot yourself. Report bugs here. \| Suggested by Abductive \| Category:Machine learning algorithms \| via #UCB_Category ← Previous edit		Revision as of 12:04, 12 October 2020 edit undo 102.182.249.239 (talk) →Example Next edit →
Line 255: </math> Finally, we will compute the smoothed probability values. These ~~result also~~results must also be scaled so that its entries sum to 1 because we did not scale the backward probabilities with the <math>c_t</math>'s found earlier. The backward probability vectors above thus actually represent the likelihood of each state at time t given the future observations. Because these vectors are proportional to the actual backward probabilities, the result has to be scaled an additional time. :<math>

Forward–backward algorithm: Difference between revisions