DocumentCode :
1312856
Title :
The segmental K-means algorithm for estimating parameters of hidden Markov models
Author :
Juang, Biing-hwang ; Rabiner, L.R.
Author_Institution :
AT&T Bell Lab., Murray Hill, NJ, USA
Volume :
38
Issue :
9
fYear :
1990
fDate :
9/1/1990 12:00:00 AM
Firstpage :
1639
Lastpage :
1641
Abstract :
The authors discuss and document a parameter estimation algorithm for data sequence modeling involving hidden Markov models. The algorithm, called the segmental K-means method, uses the state-optimized joint likelihood for the observation data and the underlying Markovian state sequence as the objective function for estimation. The authors prove the convergence of the algorithm and compare it with the traditional Baum-Welch reestimation method. They also print out the increased flexibility this algorithm offers in the general speech modeling framework
Keywords :
Markov processes; convergence; parameter estimation; speech recognition; Baum-Welch reestimation method; Markovian state sequence; convergence; data sequence modeling; hidden Markov models; parameter estimation algorithm; segmental K-means algorithm; speech modeling; speech recognition; state-optimized joint likelihood; Convergence; Density functional theory; Dynamic range; Hidden Markov models; Iterative algorithms; Maximum likelihood decoding; Maximum likelihood estimation; Parameter estimation; Signal processing algorithms; Speech recognition;
fLanguage :
English
Journal_Title :
Acoustics, Speech and Signal Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
0096-3518
Type :
jour
DOI :
10.1109/29.60082
Filename :
60082
Link To Document :
بازگشت