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:
“The child does not begin to fall until she becomes seriously interested in walking, until she actually begins learning. Falling is thus more an indication of learning than a sign of failure.”
—Polly Berrien Berends (20th century)
“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)
“Isn’t it odd that networks accept billions of dollars from advertisers to teach people to use products and then proclaim that children aren’t learning about violence from their steady diet of it on television!”
—Toni Liebman (20th century)