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:

    While I do not think it was so intended I have always been of the opinion that this turned out to be much the best for me. I had no national experience. What I have ever been able to do has been the result of first learning how to do it. I am not gifted with intuition. I need not only hard work but experience to be ready to solve problems. The Presidents who have gone to Washington without first having held some national office have been at great disadvantage.
    Calvin Coolidge (1872–1933)

    Acting is not about dressing up. Acting is about stripping bare. The whole essence of learning lines is to forget them so you can make them sound like you thought of them that instant.
    Glenda Jackson (b. 1937)

    Perhaps the mission of those who love mankind is to make people laugh at the truth, to make truth laugh, because the only truth lies in learning to free ourselves from insane passion for the truth.
    Umberto Eco (b. 1932)