Hybrid metaheuristic approaches to the expectation maximization for estimation of the hidden markov model for signal modeling

IEEE Transactions on Cybernetics

Volumn 44, Issue 10, 2014, Pages 1962-1977

  Huda, Shamsul ^a   Yearwood, John ^a   Togneri, Roberto ^b  

^a UNIVERSITY OF BALLARAT   (Australia)

^b UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

Constraint based probabilistic models; expectation maximization (EM); hidden Markov model (HMM); hybrid metaheuristics; signal modeling and classification; speech recognition

Indexed keywords

SPEECH RECOGNITION;

EXPECTATION - MAXIMIZATIONS; EXPECTATION MAXIMIZATION; HYBRID META-HEURISTIC; HYBRID METAHEURISTICS; PROBABILISTIC MODELS; SIGNAL MODELING;

HIDDEN MARKOV MODELS;

EID: 84907189481     PISSN: 21682267     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCYB.2014.2308917     Document Type: Article

References (47)

1. S. Huda, J. Yearwood, and R. Togneri, "A constraint-based evolutionary learning approach to the expectation maximization for optimal estimation of the hidden Markov model for speech signal modeling," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 39, no. 1, pp. 182-197, Feb. 2009.
2. C. Y. Suen, P. R. Cavalina, R. S. Abourin, and A. S. Britto, "Evaluation of incremental learning algorithms for HMM in the recognition of alphanumeric characters," Pattern Recognit., vol. 42, no. 12, pp. 3241-3253, 2009.
3. L. R. Rabiner, "A tutorial on hidden Markov models and selected applications in speech recognition," Proc. IEEE, vol. 77, no. 2, pp. 257-286, Feb. 1989.
4. S. E. Levinson, L. R. Rabiner, and M. M. Sondhi, "An introduction to the application of the theory of probabilistic functions of a Markov process to automatic speech recognition," Bell Syst. Tech. J., vol. 62, no. 4, pp. 1035-1074, 1983.
5. H. Li and M. Greenspan, "Model-based segmentation and recognition of dynamic gestures in continuous video streams," Pattern Recognit., vol. 44, no. 8, pp. 1614-1628, 2011.
6. A. P. Dempster, N. M. Laird, and D. B. Rubin, "Maximum likelihood from incomplete data via the EM algorithm," J. Roy. Statist. Soc., vol. 30, no. 1, pp. 1-38, 1977.
7. G. J. McLachlan and K. E. Basford, Mixture Models: Inference and Applications to Clustering. New York, NY, USA: Dekker, 1988.
8. A. J. Bilmes, "Gentle tutorial on the EM algorithm and its application to parameter estimation for Gaussian mixture and hidden Markov models," Tech. Rep. TR-97-021, ICSI, Berkeley, CA, USA, 1998.
9. T. Yada, M. Ishikawa, H. Tanaka, and K. Asai, "DNA sequence analysis using hidden Markov model and genetic algorithm," Genome Inform., vol. 5, pp. 178-179, Dec. 1994.
10. K.-J. Won, A. Prügel-Bennett, and A. Krogh, "Evolving the structure of hidden Markov models," IEEE Trans. Evol. Comput., vol. 10, no. 1, pp. 39-49, Jan. 2006.
11. D. B. Paul, "Training of HMM recognizer by simulated annealing," ICASSP '85, vol. 10, pp. 13-16, Apr. 1985.
12. Y. Hamam and T. A. Ani, "Simulated annealing approach for training hidden Markov models," in Proc. 4th WG-7.6 Working Conf. Optimization Based Computer-Aided Modeling Design, 1996, pp. 1-4.
13. G. Celeux and J. Diebolt, "The SEM algorithm: A probabilistic teacher algorithm derived from the EM algorithm for the mixture problem," Comput. Statist. Quart., vol. 2, no. 1, pp. 73-82, 1985.
14. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, no. 4598, pp. 671-680, May 1983.
15. C. Darwin, On the Origin of Species by Means of Natural Selection or the Preservation of Favoured Races in the Struggle for Life. London, U.K.: J. Murray, 1859.
16. T. Back, Evolutionary Algorithms in Theory and Practice. Oxford, U.K.: Oxford Univ. Press, 1996.
17. A. M. Martinez and J. Vitria, "Learning mixture models using a genetic version of the EM algorithm," Pattern Recognit. Lett., vol. 21, no. 8, pp. 759-769, 2000.
18. F. Pernkopf, D. Bouchaffra, P. Tefl, and C. Arth, "Genetic-based EM algorithm for learning Gaussian mixture models," IEEE Trans. Pattern Anal. Mach. Intell., vol. 27, no. 8, pp. 1344-1348, Aug. 2005.
19. N. Majdi-Nasab, M. Analoui, and E. J. Delp, "Decomposing parameters of mixture Gaussian model using genetic and maximum likelihood algorithms on dental images," Pattern Recognit. Lett., vol. 27, no. 13, pp. 1522-1536, 2006.
20. A. M. Martinez and J. Vitria, "Clustering in image space for place recognition and vcisual annotations for human-robot interaction," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 31, no. 5, pp. 669-682, Oct. 2001.
21. Y. Soon, M. H. Lim, N. Zhu, and K.W.Wong, "Classification of adaptive memetic algorithms: A comparative study," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 36, no. 1, pp. 141-152, Feb. 2006.
22. Z. Michalewicz and M. Schoenauer, "Evolutionary algorithms for constrained parameter optimization problems," Evol. Comput., vol. 4, no. 4, pp. 1-32, 1996.
23. L. R. Rabiner and B. H. Juang, Fundamentals of Speech Recognition. Englewood Cliffs, NJ, USA: Printice-Hall, 1993.
24. L. E. Baum and G. R. Sell, "Growth function for transformations on manifold," Prac. J. Math, vol. 27, no. 2, pp. 211-227, 1968.
25. N. A. Metropolis, A. Rosenbluth, A. Teller, and E. Teller, "Equation of state calculations by fast computing machines," J. Chem. Phys., vol. 21, no. 6, pp. 1087-1092, 1953.
26. M. Lundy and H. Teng, "Convergence of an annealing algorithm," Math. Programming, vol. 34, no. 1, pp. 111-124, 1986.
27. J. H. Holland, Adpatation in Natural and Artificial Systems. Ann Arbor, MI, USA: Univ. Michigan Press, 1975.
28. H. Chen and N. Flann, "Parallel simulated annealing and genetic algorithms: A space of hybrid methods," in Proc. Int. Conf. Evol. Comput. (PPSN III), LNCS 866. 1994, pp. 428-438.
29. C. Baydar, "A hybrid parallel simulated annealing algorithm to optimize store performance," in Proc. Workshop GECCO, 2002, pp. 1-6.
30. D. Whitley, G. Scott, and M. Keith, "Lamarckian evolution, the Baldwin effect and function optimization," in Proc. Parallel Problem Solving (PPSN), 1994, pp. 6-15.
31. H. Pholheim, "Genetic and evolutionary algorithm toolbox for use with MATLAB," Dept. Comput. Sci., Univ. Ilmenau, Ilmenau, Germany, Tech. Rep., 1998, http://www.geatbx.com/download/ GEATbx Tutorial v38.pdf.
32. H. Muhlenbein, "Predictive models for the breeder genetic algorithm continuous parameter optimization," Evol. Comput., vol. 1, no. 1, pp. 25-49, 1993.
33. T. Sasaki and M. Tokoro, "Comparison between Lamarckian and Darwinian evolution on a model using neural networks and genetic algorithms," Knowl. Inform. Syst, vol. 2, no. 2, pp. 201-222, 2000.
34. X. Chen, Y.-S. Ong, M.-H. Lim, and K. C. Tan, "A multi-facet survey on memetic computation," IEEE Trans. Evol. Comput., vol. 15, no. 5, pp. 591-607, Oct. 2011.
35. S. J. Garofolo, L. F. Lamel, W. M. Fisher, J. G. Fiscus, D. S. Pallett, and N. L. Dahlgren, TIMIT Acoustic-Phonetic Continuous Speech Corpus, Linguistic Data Consortium, Univ. Pennsylvania, Philadelphia, PA, USA, 1993.
36. K. E. Mathias, D. Whitley, C. Stork, and T. Kusuma, "Staged hybrid genetic search for seismic data imaging," in Proc. 1st IEEE Conf. Evol. Comput. 1st IEEE WCCI, vol. 1. 1994, pp. 356-361.
37. L. Ingber and B. Rosen, "Genetic algorithms and very fast simulated annealing: A comparison," Math. Comput. Modeling, vol. 16, no. 11, pp. 87-100, 1992.
38. A. Soke and Z. Bingul, "A hybrid genetic algorithm and simulated annealing for 2-D non-guillotine rectangular packing problems," Eng. Appl. Artif. Intell., vol. 19, no. 5, pp. 557-567, 2006.
39. D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon, "Optimization by simulated annealing: An experimental evaluation: Part II, graph coloring and number partitioning," Oper. Res., vol. 39, no. 3, pp. 378-406, 1991.
40. J. Yen, C. L. James, B. Lee, and D. Randloph, "A hybrid approach to modeling metabolic systems using genetic algorithm and simplex method," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 28, no. 2, pp. 173-191, Apr. 1998.
41. A. Sokea and Z. Bingulb, "Hybrid genetic algorithm and simulated annealing for 2-D non-guillotine rectangular packing problems," Eng. Appl. Artif. Intell., vol. 19, no. 5, pp. 557-567, 2006.
42. E. Cantu-Paz, "A survey of parallel genetic algorithms," Univ. Illinois, Urbana-Champaign, IL, USA, Tech. Rep. IllGAL 97003, 1997.
43. Y. S. Yung and Y. H. Oh, "A segmental-feature HMM for continuous speech recognition based on a parametric trajectory model," Speech Commun., vol. 38, no. 1, pp. 115-130, 2002.
44. L. Gillick and S. Cox, "Some statistical issue in the comparison of speech recognition algorithms," in Proc. IEEE ICASSP, 1989, pp. 532-535.
45. N. Harte, D. Lennon, and A. Kokaram, "On parsing visual sequences with the hidden Markov model," EURASIP J. Image Video Process., vol. 2009, no. 6, pp. 1-13, Jan. 2009.
46. N. Jojic, N. Petrovic, B. Frey, and T. Huang, "Transformed hidden Markov models: Estimating mixture models of images and inferring spatial transformations in video sequences," in Proc. IEEE Conf. Comput. Vision Pattern Recognit., vol. 2, pp. 26-33, Jun. 2000.
47. S. Sun, "Haplotype inference using a hidden Markov model with efficient Markov chain sampling," Ph.D. dissertation, Graduate Dept. Statistics, Univ. Toronto, Toronto, ON, Canada, 2007.