(algorithm)
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 <uk_arvind@mail.utexas.edu> May 2002.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 7 July 2004.
HTML page formatted Mon Feb 2 13:10:39 2015.
Cite this as:
Paul E. Black, "Baum Welch algorithm", in
Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 7 July 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/baumWelch.html