Hidden Markov model

From Free net encyclopedia

Image:MarkovModel.png A hidden Markov model (HMM) is a statistical model where the system being modeled is assumed to be a Markov process with unknown parameters, and the challenge is to determine the hidden parameters, from the observable parameters, based on this assumption. The extracted model parameters can then be used to perform further analysis, for example for pattern recognition applications.

In a regular Markov model, the state is directly visible to the observer, and therefore the state transition probabilities are the only parameters. A hidden Markov model adds outputs: each state has a probability distribution over the possible output tokens. Therefore, looking at a sequence of tokens generated by an HMM does not directly indicate the sequence of states.

Contents

History

Hidden Markov Models were first described in a series of statistical papers by Leonard E. Baum and other authors in the second half of the 1960s. One of the first applications of HMMs was speech recognition, starting in the middle of the 1970s.<ref>Rabiner, p. 258</ref>

In the second half of the 1980s, HMMs began to be applied to the analysis of biological sequences, in particular DNA. Since then, they have become ubiquitous in the field of bioinformatics.<ref>Durbin</ref>

Evolution of a Markov model

The preceding diagram emphasizes the state transitions of a hidden Markov model. It is also useful to explicitly represent the evolution of the model over time, with the states at different times t1 and t2 represented by different variables, x(t1) and x(t2).

Image:Hmm temporal bayesian net.png

In this diagram, it is understood that the time slices (x(t), y(t)) extend to previous and following times as needed. Typically the earliest slice is at time t=0 or time t=1.

Using Markov models

There are 3 canonical problems to solve with HMMs:

  • Given the model parameters, compute the probability of a particular output sequence. Solved by the forward algorithm.
  • Given the model parameters, find the most likely sequence of (hidden) states which could have generated a given output sequence. Solved by the Viterbi algorithm.
  • Given an output sequence, find the most likely set of state transition and output probabilities. Solved by the Baum-Welch algorithm.

A concrete example

Template:HMM example

This example is further elaborated in Viterbi algorithm page.

Applications of hidden Markov models

See also

Notes

<references/>

References

External links

de:Hidden Markov Model nl:Hidden Markov Model ja:隠れマルコフモデル sl:Skriti model Markova fi:Markovin piilomalli sv:Dolda Markovmodeller vi:Mô hình Markov ẩn