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:
“Nature will not let us fret and fume. She does not like our benevolence or our learning much better than she likes our frauds and wars. When we come out of the caucus, or the bank, or the abolition-convention, or the temperance-meeting, or the transcendental club, into the fields and woods, she says to us, “so hot? my little Sir.””
—Ralph Waldo Emerson (1803–1882)
“You taught me language, and my profit on’t
Is, I know how to curse. The red plague rid you
For learning me your language!”
—William Shakespeare (1564–1616)
“In the world of letters, learning and knowledge are one, and books are the source of both; whereas in science, as in life, learning and knowledge are distinct, and the study of things, and not of books, is the source of the latter.”
—Thomas Henry Huxley (1825–95)