Statistics Inference for stochastic processes and time series Concept
Baum–Welch algorithm
Summary
The Baum–Welch algorithm estimates the parameters of a hidden Markov model from a sequence of observations alone. It is the expectation–maximization algorithm for this model. It alternates between computing the expected hidden path under the current parameters and re-estimating the parameters from those expectations. The expectations are computed efficiently by the forward–backward recursions. It is a standard tool in speech recognition and in biological sequence analysis.
Further reading
About this page
| Tag | W7P6CCSMX7 |
|---|---|
| URI | m2://W7P6CCSMX7 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 62M05, 62F10 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.