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:

    “To begin with the wine jar in learning the potter’s art.”
    —Plato (c. 427–347 B.C.)

    “Nature is a self-made machine, more perfectly automated than any automated machine. To create something in the image of nature is to create a machine, and it was by learning the inner working of nature that man became a builder of machines.”
    —Eric Hoffer (1902–1983)

    “You may judge a man’s learning by the marks in his books.”
    —Chinese proverb.