An Exponential Representation in the API Algorithm for Hidden Markov Models Training

In this paper, we show how an efficient ant based algorithm, called API and initially designed to perform real parameter optimization, can be adapted to the difficult problem of Hidden Markov Models training. To this aim, a transformation of the search space that preserves API's vectorial moves is introduced. Experiments are conducted with various temporal series extracted from images.

[1]  J. Dréo,et al.  Continuous interacting ant colony algorithm based on dense heterarchy , 2004, Future Gener. Comput. Syst..

[2]  Mohamed Slimane,et al.  Optimizing Hidden Markov Models with a Genetic Algorithm , 1995, Artificial Evolution.

[3]  D. B. Paul.  Training of HMM recognizers by simulated annealing , 1985, ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[4]  Ian C. Parmee,et al.  The Ant Colony Metaphor for Searching Continuous Design Spaces , 1995, Evolutionary Computing, AISB Workshop.

[5]  Nicolas Monmarché,et al.  An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem , 2002, Eur. J. Oper. Res..

[6]  Nicolas Monmarché,et al.  Algorithmes de fourmis artificielles : applications à la classification et à l'optimisation. (Artificial ant based algorithms applied to clustering and optimization problems) , 2000 .

[7]  J. Deneubourg,et al.  From individual to collective behavior in social insects , 1987 .

[8]  Lawrence R. Rabiner,et al.  A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.

[9]  Marco Dorigo,et al.  The ant colony optimization meta-heuristic , 1999 .

[10]  T. Stützle,et al.  MAX-MIN Ant System and local search for the traveling salesman problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[11]  L. Baum,et al.  A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains , 1970 .

[12]  Zemin Liu,et al.  A general CAC approach using novel ant algorithm training based neural network , 1999, IJCNN'99. International Joint Conference on Neural Networks. Proceedings (Cat. No.99CH36339).

[13]  J. Deneubourg,et al.  Self-organization mechanisms in ant societies. II: Learning in foraging and division of labor , 1987 .

[14]  Ching-Jong Liao,et al.  An ant colony system for permutation flow-shop sequencing , 2004, Comput. Oper. Res..

[15]  Yoram Singer,et al.  The Hierarchical Hidden Markov Model: Analysis and Applications , 1998, Machine Learning.

[16]  Andy Harter,et al.  Parameterisation of a stochastic model for human face identification , 1994, Proceedings of 1994 IEEE Workshop on Applications of Computer Vision.

[17]  Nicolas Monmarché,et al.  On how Pachycondyla apicalis ants suggest a new search algorithm , 2000, Future Gener. Comput. Syst..

[18]  Marco Dorigo,et al.  Ant algorithms and stigmergy , 2000, Future Gener. Comput. Syst..

[19]  Jr. G. Forney,et al.  The viterbi algorithm , 1973 .

[20]  Jeng-Shyang Pan,et al.  Optimization of HMM by the Tabu Search Algorithm , 2004, J. Inf. Sci. Eng..

[21]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[22]  Thomas Stützle,et al.  ACO algorithms for the quadratic assignment problem , 1999 .

[23]  D. Fresneau,et al.  Individual foraging and path fidelity in a ponerine ant , 1985, Insectes Sociaux.

[24]  Mohamed Slimane,et al.  Hybrid Genetic Learning of Hidden Markov Models for Time Series Prediction , 1998 .

[25]  Marco Dorigo,et al.  Swarm intelligence: from natural to artificial systems , 1999 .

[26]  Olivier Cappé,et al.  Ten years of HMMs , 2001 .