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:
“Paul, thou art beside thyself; much learning doth make thee mad.”
—Bible: New Testament Acts, 26:24.
Said by Festus, the Roman Procurator.
“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)
“And hiving wisdom with each studious year,
In meditation dwelt, with learning wrought,
And shaped his weapon with an edge severe,
Sapping a solemn creed with solemn sneer.”
—George Gordon Noel Byron (1788–1824)