Content deleted Content added
m Signing comment by 128.187.80.2 - "I propose that we stop trying to explain this algorithm in matrix form, and I make arguments in favor of this idea." |
Bodhi.root (talk | contribs) No edit summary |
||
Line 92:
I am generally new to editing at Wikipedia but tried to follow the guidelines I found to be relevant. If the content is not found suitable, contains errors or is otherwise unsuitable, I certainly welcome feedback, critique and any edits, including deletions, deemed necessary :)
[[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]])
==Explaining this algorithm with Matrices==
| |||