Talk:Forward–backward algorithm: Difference between revisions

Content deleted Content added
No edit summary
SineBot (talk | contribs)
m Dating comment by Bodhi.root - ""
Line 93:
[[User:BJJV|BJJV]] ([[User talk:BJJV|talk]]) 11:08, 26 May 2008 (UTC)
 
I just finished cleaning up the page a bit to try and make it easier to follow. Hopefully I didn't make things worse. I am new to the subject but described the problem as it is addressed in the first reference (Rabiner, 1989). I also modified the notation so that the forward probabilities use subscripts of the form: <math>\mathbf{f_{0:t}}</math> (zero-based instead of one-based). This provides a consistent form that describes the problem and allows us to calculate the state vector at time t=0. I also used the "hat" to distinguish between the actual probabilities of an event sequence and the normalized values that describe the state vector. I hope the notation is OK, and I worry about my terminology (is "state vector" appropriate? despite my reading I can't find what this is actually called). Also, my opinion is that the matrix example is very helpful. I found it useful for checking my results when I developed an HMM program and think it should be left in. [[User:Bodhi.root|Bodhi.root]] ([[User talk:Bodhi.root|talk]]) <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|undated]] comment added 19:36, 15 September 2009 (UTC).</span><!--Template:Undated--> <!--Autosigned by SineBot-->
 
==Explaining this algorithm with Matrices==