3. Baum–Welch algorithm

Baum–Welch Baum–Welch algorithm In electrical engineering, engineering, computer science, science, statistical computing and bioinformatics and bioinformatics,, the Baum–Welch algorithm is used to find the unknown parameters of a hidden Markov model (HMM). It makes use of the forward-backward algorithm and is named for  Leonard E. Baum and Lloyd R. Welch. Welch.

Contents [hide hide]]

•

1 Explanation 2 See also 3 References

•

4 External links

• •

[edit edit]] Explanation The Baum–Welch algorithm is a particular case of a generalized expectationmaximization (GEM) algorithm. It can compute maximum likelihood estimates and  posterior mode estimates for the parameters (transition and emission (lấy (lấy ra)  probabilities) of an HMM, when given only emissions as training data. For a given cell S i in the transition matrix, all paths to that cell are summed. There is a link (transition from that cell to a cell S  j). The joint probability of S i, the link, and S  j can  be calculated and normalized by the probability of the entire string. Call this χ.  Now, calculate the probability of all paths with all links emanating from S i. Normalize this by the probability of the entire string. Call this σ.  Now divide χ by σ. This is dividing the expected transition from S i to S  j by the expected transitions from S i. As the corpus grows, and particular transitions are reinforced, they will increase in value, reaching a local maximum. No way to ascertain a global maximum is known.

[edit edit]] See also • •

Viterbi algorithm Hidden Markov Model

[edit edit]] References

The algorithm was introduced in the paper: •

L. E. Baum, T. Petrie, G. Soules, and N. Weiss, "A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains", chains", Ann. Math. Statist., vol. 41, no. 1, pp. 164–171, 1970.

The Shannon Lecture by Welch, which speaks to how the algorithm can be implemented efficiently: •

Hidden Markov Models and the Baum–Welch Algorithm, Algorithm, IEEE Information Theory Society Newsletter, Dec. 2003.

The path-counting algorithm, an alternative to the Baum–Welch algorithm: •

Comparing and Evaluating HMM Ensemble Training Algorithms Using Train and Test and Condition Number Criteria, Criteria, Journal of Pattern Analysis and Applications, 2003.

[edit edit]] External links •

• •

An Interactive Spreadsheet for Teaching the Forward-Backward Algorithm (spreadsheet and article with step-by-step walkthrough) Formal derivation of the Baum-Welch algorithm Implementation of the Baum-Welch algorithm

Ref: http://en.wikipedi http://en.wikipedia.org/wiki/Baum%E2%80% a.org/wiki/Baum%E2%80%93Welch_algorithm 93Welch_algorithm