Hidden Markov models: the theory
Hidden Markov models for sequence labeling
Article REF: AF615 V1
Hidden Markov models: the theory
Hidden Markov models for sequence labeling

Author : Thierry ARTIÈRES

Publication date: April 10, 2013 | Lire en français

Logo Techniques de l'Ingenieur You do not have access to this resource.
Request your free trial access! Free trial

Already subscribed?

3. Hidden Markov models: the theory

We begin by presenting the principle of hidden Markov models, detailing the assumptions on which they are based and illustrating how they work with a few examples. Then, in keeping with tradition, we present hidden Markov models in terms of the "three problems" that need to be solved in order to use them in practice:

  • calculating the probability of a sequence of observations;

  • inference of the optimal state sequence given a sequence of observations ;

  • learning the parameters of a hidden Markov model from a corpus of training sequences.

Finally, we mention a few particularly popular variants of hidden Markov models.

3.1 Definition and principle

...
You do not have access to this resource.
Logo Techniques de l'Ingenieur

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource. Click here to request your free trial access!

Already subscribed?


Article included in this offer

"Mathematics"

( 166 articles )

Complete knowledge base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

View offer details
Contact us