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:
“Learning without thinking is labor lost; thinking without learning is dangerous.”
—Chinese proverb.
“Spend the years of learning squandering
Courage for the years of wandering”
—Samuel Beckett (1906–1989)
“Laughing at someone else is an excellent way of learning how to laugh at oneself; and questioning what seem to be the absurd beliefs of another group is a good way of recognizing the potential absurdity of many of one’s own cherished beliefs.”
—Gore Vidal (b. 1925)