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 learning the language in France a young man’s morals, health and fortune are more irresistibly endangered than in any country of the universe.
    Thomas Jefferson (1743–1826)

    Young children learn in a different manner from that of older children and adults, yet we can teach them many things if we adapt our materials and mode of instruction to their level of ability. But we miseducate young children when we assume that their learning abilities are comparable to those of older children and that they can be taught with materials and with the same instructional procedures appropriate to school-age children.
    David Elkind (20th century)

    Some, for renown, on scraps of learning dote,
    And think they grow immortal as they quote.
    Edward Young (1683–1765)