Hidden Markov Model - Learning

Learning

The parameter learning task in HMMs is to find, given an output sequence or a set of such sequences, the best set of state transition and output probabilities. The task is usually to derive the maximum likelihood estimate of the parameters of the HMM given the set of output sequences. No tractable algorithm is known for solving this problem exactly, but a local maximum likelihood can be derived efficiently using the Baum–Welch algorithm or the Baldi–Chauvin algorithm. The Baum–Welch algorithm is a special case of the expectation-maximization algorithm.

Read more about this topic:  Hidden Markov Model

Famous quotes containing the word learning:

    ““It’s hard enough to adjust [to the lack of control] in the beginning,” says a corporate vice president and single mother. “But then you realize that everything keeps changing, so you never regain control. I was just learning to take care of the belly-button stump, when it fell off. I had just learned to make formula really efficiently, when Sarah stopped using it.””
    —Anne C. Weisberg (20th century)

    “For infants and toddlers learning and living are the same thing. If they feel secure, treasured, loved, their own energy and curiosity will bring them new understanding and new skills.”
    —Amy Laura Dombro (20th century)

    “Gold has a price, but learning is priceless.”
    —Chinese proverb.