Baum-welch Algorithm
The Baum-Welch Algorithm is an expectation-maximization algorithm used to estimate the parameters of a hidden Markov model by iteratively maximizing the likelihood of observed data given the model.
241
Publications
14.9K
Citations
575
Authors
261
Institutions
Publications per year
2017–2026
33
Variants
Baum-welch
Parents
241
The generalized distributive law
S.M. Aji, Robert J. McEliece · IEEE Transactions on Information Theory · 2000 · 754 citations
1–5 of 241
575
5
h-index
4
h-index
4
h-index
4
h-index
4
h-index
1–5 of 575
261
Universitat Politècnica de Catalunya
Barcelona, Spain
5 h-index
11 publications
301 citations
University of Washington
Seattle, United States
5 h-index
8 publications
276 citations
AT&T (United States)
Bedminster, United States
5 h-index
10 publications
1.4K citations

Australian National University
Canberra, Australia
4 h-index
6 publications
644 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
4 h-index
15 publications
2.4K citations
Georgia Institute of Technology
Atlanta, United States
4 h-index
9 publications
325 citations

Stevens Institute of Technology
Hoboken, United States
4 h-index
4 publications
136 citations
University of California, Berkeley
Berkeley, United States
4 h-index
6 publications
2.9K citations
1–8 of 261
11 publications · 673 citations
11
h-index
5 publications · 454 citations
5
h-index
4 publications · 168 citations
4
h-index
4 publications · 197 citations
4
h-index
TASLP · 4 publications · 138 citations
4
h-index
1–5