GMM parameter estimation by means of EM and genetic algorithms

2Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Most of the state-of-the-art speech recognition systems use Hidden Markov Models as an acoustic model, since there is a powerful Expectation-Maximization algorithm for its training. One of the important components of the continuous HMM we focus on is an emission probability which can be approximated by the weighted sum of Gaussians. Although, EM is a very fast iterative algorithm it can only guarantee a convergence to a local result. Therefore, the initialization process determines the final result. We suggested here two modifications of genetic algorithms for the initialization of EM. They are compared to the results of the EM with the same number of local multi-starts. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Zablotskiy, S., Pitakrat, T., Zablotskaya, K., & Minker, W. (2011). GMM parameter estimation by means of EM and genetic algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6761 LNCS, pp. 527–536). https://doi.org/10.1007/978-3-642-21602-2_57

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free