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:
“Our day of dependence, our long apprenticeship to the learning of other lands, draws to a close. The millions, that around us are rushing into life, cannot always be fed on the sere remains of foreign harvests.”
—Ralph Waldo Emerson (1803–1882)
“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)
“‘Tis very certain that each man carries in his eye the exact indication of his rank in the immense scale of men, and we are always learning to read it. A complete man should need no auxiliaries to his personal presence.”
—Ralph Waldo Emerson (1803–1882)