Talk:Forward–backward algorithm: Difference between revisions

Revision as of 17:18, 21 July 2010

Revision as of 23:07, 4 August 2010

Line 115:

Semi-agreed semi-disagreed. I am taking a class on HMM and this matrix treatment of the algorithms was sorely needed. However the switch from right multiplication in the description of the forward algorithm to left in the example is a serious mistake, especially since the transposes that are necessary are invisible in the example since the matricies are symmetrical. What this page needs is an introductory section without the matrix notation and a cleanup of the matrix examples/explanation, but please don't jettison a useful resource. --[[User:Wjeck|Wjeck]] ([[User talk:Wjeck|talk]]) 13:54, 25 November 2009 (UTC)

I agree. The problem for me is one of clarity, not accessibility or computational efficiency. Matrix notation is meant to make some concepts clearer, and this is not really one of them. It should be fine to keep the matrix notation in another section, but the first description should be in more straightforward terms. But I tried looking for such an explanation on the web, and couldn't find it, so maybe the first step would be to link to one from this article. I didn't find Russell and Norvig's presentation very clear. [[User:A5|A5]] ([[User talk:A5|talk]]) 23:07, 4 August 2010 (UTC)