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:
“A little learning is a dang’rous thing;
Drink deep, or taste not the Pierian spring:
There shallow draughts intoxicate the brain,
And drinking largely sobers us again.”
—Alexander Pope (1688–1744)
“The first man to discover Chinook salmon in the Columbia, caught 264 in a day and carried them across the river by walking on the backs of other fish. His greatest feat, however, was learning the Chinook jargon in 15 minutes from listening to salmon talk.”
—State of Oregon, U.S. public relief program (1935-1943)
“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)