Definition: An algorithm to find hidden Markov model parameters A, B, and Π with the maximum likelihood of generating the given symbol sequence in the observation vector.
Aggregate child (... is a part of or used in me.)
hidden Markov model.
See also Viterbi algorithm.
Note: Contributed by Arvind <email@example.com> May 2002.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 3 September 2019.
HTML page formatted Fri Sep 6 15:26:10 2019.
Cite this as:
Paul E. Black, "Baum Welch algorithm", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 3 September 2019. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/baumWelch.html