{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:01:34Z","timestamp":1725544894275},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540335894"},{"type":"electronic","value":"9783540335900"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11740698_6","type":"book-chapter","created":{"date-parts":[[2006,4,27]],"date-time":"2006-04-27T10:15:33Z","timestamp":1146132933000},"page":"61-72","source":"Crossref","is-referenced-by-count":1,"title":["An Exponential Representation in the API Algorithm for Hidden Markov Models Training"],"prefix":"10.1007","author":[{"given":"S\u00e9bastien","family":"Aupetit","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Monmarch\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Slimane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Liardet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Douglas, B.P.: Training of hmm recognizers by simulated annealing. In: Proceedings of ICASSP 1985, pp. 13\u201316 (1985)"},{"key":"6_CR2","first-page":"949","volume":"20","author":"T.Y. Chen","year":"2004","unstructured":"Chen, T.Y., Mei, X.D., Pan, J.S., Sun, S.H.: Optimization of HMM by the tabu search algorithm. Journal of Information science and engineering\u00a020, 949\u2013957 (2004)","journal-title":"Journal of Information science and engineering"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/3-540-61108-8_52","volume-title":"Artificial Evolution","author":"M. Slimane","year":"1996","unstructured":"Slimane, M., Venturini, G., Asselin de Beauville, J.P., Brouard, T., Brandeau, A.: Optimizing hidden Markov models with a genetic algorithm. In: Alliot, J.-M., Ronald, E., Lutton, E., Schoenauer, M., Snyers, D. (eds.) AE 1995. LNCS, vol.\u00a01063, pp. 384\u2013396. Springer, Heidelberg (1996)"},{"key":"6_CR4","volume-title":"Biomimetic approaches in management science","author":"M. Slimane","year":"1998","unstructured":"Slimane, M., Venturini, G., Asselin de Beauville, J.P., Brouard, T.: Hybrid genetic learning of hidden markov models for time series prediction. In: Biomimetic approaches in management science, Kluwer Academics, Dordrecht (1998)"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1016\/S0167-739X(00)00047-9","volume":"16","author":"N. Monmarch\u00e9","year":"2000","unstructured":"Monmarch\u00e9, N., Venturini, G., Slimane, M.: On how Pachycondyla apicalis ants suggest a new search algorithm. Future Generation Computer Systems\u00a016, 937\u2013946 (2000)","journal-title":"Future Generation Computer Systems"},{"key":"6_CR6","unstructured":"Capp\u00e9, O.: Ten years of HMM. http:\/\/ww.tsi.enst.fr\/~cappe\/docs\/hmmbib.html (2001)"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1023\/A:1007469218079","volume":"32","author":"S. Fine","year":"1998","unstructured":"Fine, S., Singer, Y., Tishby, N.: The Hierarchical Hidden Markov Model: Analysis and applications. Machine Learning\u00a032, 41\u201362 (1998)","journal-title":"Machine Learning"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/5.18626","volume":"77","author":"L. Rabiner","year":"1989","unstructured":"Rabiner, L.: A tutorial on hidden Markov models and selected applications in speech recognition. Proceedings of IEEE\u00a077, 257\u2013286 (1989)","journal-title":"Proceedings of IEEE"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1109\/PROC.1973.9030","volume":"61","author":"G. Forney","year":"1973","unstructured":"Forney, G.: The Viterbi algorithm. Proceedings of IEEE\u00a061, 268\u2013278 (1973)","journal-title":"Proceedings of IEEE"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1214\/aoms\/1177697196","volume":"41","author":"L. Baum","year":"1970","unstructured":"Baum, L., Petrie, T., Soules, G., Weiss, N.: A maximization technique occuring in the statistical analysis of probabilistic functions of markov chains. Ann. Math. Stat.\u00a041, 164\u2013171 (1970)","journal-title":"Ann. Math. Stat."},{"key":"6_CR11","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195131581.001.0001","volume-title":"Swarm Intelligence: From Natural to Artificial Systems","author":"E. Bonabeau","year":"1999","unstructured":"Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press, New York (1999)"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1016\/S0167-739X(00)00042-X","volume":"16","author":"M. Dorigo","year":"2000","unstructured":"Dorigo, M., Bonabeau, E., Theraulaz, G.: Ant algorithms and stygmergy. Future Generation Computer Systems\u00a016, 851\u2013871 (2000)","journal-title":"Future Generation Computer Systems"},{"key":"6_CR13","first-page":"11","volume-title":"New Ideas in Optimisation","author":"M. Dorigo","year":"1999","unstructured":"Dorigo, M., Di Caro, G.: The Ant Colony Optimization Meta-Heuristic. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimisation, Belgium, pp. 11\u201332. McGraw-Hill, London, UK (1999); also available as Tech.Rep.IRIDIA\/99-1, Universit\u00e9 Libre de Bruxelles, Belgium"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.: Ant Colony Sytem: A cooperative learning approach to the Travelling Salesman Problem. IEEE Transactions on Evolutionary Computation\u00a01, 53\u201366 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"6_CR15","unstructured":"St\u00fctzle, T., Hoos, H.: MAX\u2009\u2212\u2009MIN Ant System and local search for the Traveling Salesman Problem. In: IEEE (ed.) Proceedings of the fourth International Conference on Evolutionary Computation (ICEC), pp. 308\u2013313. IEEE Press, Los Alamitos (1997)"},{"key":"6_CR16","first-page":"33","volume-title":"New Ideas in Optimisation","author":"T. St\u00fctzle","year":"1999","unstructured":"St\u00fctzle, T., Dorigo, M.: ACO algorithms for the Quadratic Assignment Problem. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimisation, pp. 33\u201350. McGraw-Hill, London, UK (1999)"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/S0377-2217(02)00265-5","volume":"142","author":"V. T\u2019Kindt","year":"2002","unstructured":"T\u2019Kindt, V., Monmarch\u00e9, N., Tercinet, F., La\u00fcgt, D.: An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem. European Journal of Operational Research\u00a0142, 250\u2013257 (2002)","journal-title":"European Journal of Operational Research"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1016\/S0305-0548(03)00038-8","volume":"31","author":"K.C. Ying","year":"2004","unstructured":"Ying, K.C., Liao, C.J.: An ant colony system for permutation flow-shop sequencing. Computers & Operations Research\u00a031, 791\u2013801 (2004)","journal-title":"Computers & Operations Research"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/3-540-60469-3_22","volume-title":"Evolutionary Computing","author":"G. Bilchev","year":"1995","unstructured":"Bilchev, G., Parmee, I.: The ant colony metaphor for searching continuons design spaces. In: Fogarty, T.C. (ed.) AISB-WS 1995. LNCS, vol.\u00a0993, pp. 24\u201339. Springer, Heidelberg (1995)"},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"1885","DOI":"10.1109\/IJCNN.1999.832668","volume":"3","author":"S. Li","year":"1999","unstructured":"Li, S., Liu, Z.: General CAC approach using novel ant algorithm training based neural network. Proceedings of the International Joint Conference on Neural Networks\u00a03, 1885\u20131888 (1999)","journal-title":"Proceedings of the International Joint Conference on Neural Networks"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Dr\u00e9o, J., Siarry, P.: Continuous interacting ant colony algorithm based on dense heterarchy. In: Future Generation Computer Systems (in press 2004)","DOI":"10.1016\/j.future.2003.07.015"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF02224226","volume":"32","author":"D. Fresneau","year":"1985","unstructured":"Fresneau, D.: Individual foraging and path fidelity in a ponerine ant. Insectes Sociaux, Paris\u00a032, 109\u2013116 (1985)","journal-title":"Insectes Sociaux, Paris"},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1016\/S0167-739X(00)00047-9","volume":"16","author":"N. Monmarch\u00e9","year":"2000","unstructured":"Monmarch\u00e9, N., Venturini, G., Slimane, M.: On how Pachycondyla apicalis ants suggest a new search algorithm. Future Generation Computer Systems\u00a016, 937\u2013946 (2000)","journal-title":"Future Generation Computer Systems"},{"key":"6_CR24","unstructured":"Monmarch\u00e9, N.: Algorithmes de fourmis artificielles: applications \u00e0 la classification et \u00e0 l\u2019optimisation. Th\u00e8se de doctorat, Laboratoire d\u2019Informatique, Universit\u00e9 de Tours (2000)"},{"key":"6_CR25","unstructured":"Deneubourg, J., Goss, S., Pasteels, J., Fresneau, D., Lachaud, J.: Self-organization mechanisms in ant societies (ii): learning in foraging and division of labor. In: Pasteels, J., Deneubourg, J. (eds.) From individual to collective behavior in social insects, Experientia supplementum, vol.\u00a054, pp. 177\u2013196. Bikhauser Verlag (1987)"},{"key":"6_CR26","unstructured":"Soukhal, A., Monmarch\u00e9, N., La\u00fcgt, D., Slimane, M.: How hidden markov models can help artificial ants to optimize. In: Proceedings of the Optimization by Building and Using Probabilistic Models workshop, Genetic and Evolutionary Computation Conference, pp. 226\u2013229 (2001)"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Samaria, F., Harter, A.: Parameterisation of a stochastic model for human face identification. In: IEEE workshop on Applications of Computer Vision, Florida (1994)","DOI":"10.1109\/ACV.1994.341300"}],"container-title":["Lecture Notes in Computer Science","Artificial Evolution"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11740698_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,26]],"date-time":"2021-07-26T00:43:14Z","timestamp":1627260194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11740698_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540335894","9783540335900"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/11740698_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}