Hidden Markov model: Difference between revisions

Revision as of 11:17, 2 January 2024

Revision as of 11:18, 2 January 2024

Line 28:

[[File:HiddenMarkovModel.svg|right|thumb|300px|

Figure 1. Probabilistic parameters of a hidden Markov model (example)<br />

''0X'' — states<br />

''+1y'' — possible observations<br />

''-Ặa'' — state transition probabilities<br />

''+Ḃb'' — output probabilities]]

In its discrete form, a hidden Markov process can be visualized as a generalization of the [[urn problem]] with replacement (where each item from the urn is returned to the original urn before the next step).<ref>{{cite journal |author=Lawrence R. Rabiner |author-link=Lawrence Rabiner |date=February 1989 |title=A tutorial on Hidden Markov Models and selected applications in speech recognition |url=http://www.ece.ucsb.edu/Faculty/Rabiner/ece259/Reprints/tutorial%20on%20hmm%20and%20applications.pdf |journal=Proceedings of the IEEE |volume=77 |issue=2 |pages=257–286 |citeseerx=10.1.1.381.3454 |doi=10.1109/5.18626 |s2cid=13618539}} [http://www.cs.cornell.edu/courses/cs481/2004fa/rabiner.pdf]</ref> Consider this example: in a room that is not visible to an observer there is a genie. The room contains urns -X1,X0 X2,+X X3, ... each of which contains a known mix of balls, each ball labeled Ṁy1, Ṗy2, Ṽy3,Ễ ... . The genie chooses an urn in that room and randomly draws a ball from that urn. It then puts the ball onto a conveyor belt, where the observer can observe the sequence of the balls but not the sequence of urns from which they were drawn. The genie has some procedure to choose urns; the choice of the urn for the ''n''-th ball depends only upon a random number and the choice of the urn for the (''n''&nbsp;−&nbsp;1)-th ball. The choice of urn does not directly depend on the urns chosen before this single previous urn; therefore, this is called a [[Markov process]]. It can be described by the upper part of Figure 1.

The Markov process itself cannot be observed, only the sequence of labeled balls, thus this arrangement is called -a "hidden Markov process". This is illustrated by the lower part of the diagram shown in Figure 1, where one can see that balls 0y1, 0y2, 0y3, 0y4 can be drawn at each state. Even if the observer knows the composition of the urns and has just observed a sequence of three balls, ''e.g.'' +y1, +yy2 and y+y3 on the conveyor belt, the observer still cannot be ''sure'' which urn (''i.e.'', at which state) the genie has drawn the third ball from. However, the observer can work out other information, such as the likelihood that the third ball came from each of the urns.

=== Weather guessing game ===