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:
“‘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)
“Their holders have always seemed to me like a woman who should undertake at a state fair to run a sewing machine, under pretense of advertising it, while she had never spent an hour in learning its use.”
—Jane Grey Swisshelm (1815–1884)
“Ignorance of what real learning is, and a consequent suspicion of it; materialism, and a consequent intellectual laxity—both of these have done destructive work in the colleges.”
—Katharine Fullerton Gerould (1879–1944)