Hidden Markov Model

Hidden Markov Models

A Hidden Markov Model(N,,Θ) consists of the following elements:

1.N is a positive integer specifying the number of states in the model. Without loss of generality, we will take the Nth state to be a special state, the final or stop state.

2. is a set of output symbols, for example =a,b

3.Θ is a vector of parameters. It contains three types of parameters:
πj for j=1N is the probability of choosing state j as an initial state. Note that j=1Nπj=1

aj,k for j=1(N1),k=1N

is the probability of transitioning from state j to state k. Note that for all j,

k=1Naj,k=1

bj(o) for j=1N1, and o,

is the probability of emitting symbol o from state j. Note that for all j,

obj(o)=1.

Thus it can be seen that Θ is a vector of N+(N1)N+(N1)|| parameters.

An HMM specifies a probability for each possible (x,y) pair, where x is a sequence of symbols drawn from , and y is a sequence of states drawn from the integers 1N1. The sequences x and y are restricted to have the same length. As an example, say we have an HMM with N=3,a,b, and with some choice of the parameters Θ. Take x=a,a,b,b and y=1,2,2,1. Then in this case,
P(x,y|Θ)=π1a1,2a2,2a2,1a1,3b1(a)b2(a)b2(b)b1(b)

Thus we have a product of terms specifying the probability of emitting each symbol from its associated state.

In general, if we have the sequence x, and the sequence y,

P(x,y|Θ)

=πy1ayn,NProdj=2nayj1,yjProdj=1nbyj(xj)

Thus we see that the probability is a simple function of the prameters Θ.