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:
“You taught me language, and my profit ont
Is, I know how to curse. The red plague rid you
For learning me your language!”
—William Shakespeare (15641616)
“Just as we are learning to value and conserve the air we breathe, the water we drink, the energy we use, we must learn to value and conserve our capacity for nurture. Otherwise, in the name of human potential we will slowly but surely erode the source of our humanity.”
—Elaine Heffner (20th century)
“You may judge a mans learning by the marks in his books.”
—Chinese proverb.