Abstract
We use the heuristic known as ant colony optimization in the partitioning problem for improving solutions of k-means method (McQueen (1967)). Each ant in the algorithm is associated with a partition, which is modified by the principles of the heuristic; that is, by the random selection of an element, and the assignment of another element which is chosen according to a probability that depends on the pheromone trail (related to the overall criterion: the maximization of the between-classes variance), and a local criterion (the distance between objects). The pheromone trail is reinforced for those objects that belong to the same class. We present some preliminary results, compared to results of other techniques, such as simulated annealing, genetic algorithms, tabu search, and k-means. Our results are as good as the best of the above methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aarts, E. M., Korst, J. (1988). Simulated Annealing and Boltzmann Machines, Wiley, Chichester.
Bock, H.-H. (1974). Automatische Klassifikation, Vandenhoeck & Ruprecht, Göttingen.
Bonabeau, E., Dorigo, M., and Therauluz, G. (1999). Swarm Intelligence. From Natural to Artificial Systems, Oxford University Press, New York.
Castillo, W., and Trejos, J. (2002). “Two-Mode Partitioning: Review of Methods and Application of Tabu Search,” in Classification, Clustering, and Data Analysis, eds. K. Jajuga, et al., Berlin: Springer, pp. 43–51.
Diday, E., Lemaire, J., Pouget, J., and Testu, F. (1982). Eléments d’Analyse des Données, Dunod, Paris.
Gambardella, L. M., Taillard, E. D., and Dorigo, M. (1999). “Ant Colonies for the QAP,” Journal of Operations Research Society, 50, 167–176.
Glover, F., et al. (1993). “Tabu Search: An Introduction,” Annals of Operations Research, 41, 1–28.
Goldberg, D. E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading MA.
McQueen, J.B. (1967). “Some Methods for Classification and Analysis of Multivariate Observations,” Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, Vol. 1, Berkeley: University of California Press.
Murillo, A. (2000). “Aplicaciön de la Búsqueda Tabu en la Clasificaciön por Particiones,” Investigacion Operacional, 21, 183–194.
Piza, E., and Trejos, J. (1995). “Particionamiento Usando Sobrecalentamiento Simulado y Algoritmos Genéticos,” in IX SIMM AC, ed. J. Trejos, Universidad de Costa Rica, Turrialba, pp. 121–132.
Trejos, J., Murillo, A., and Piza, E. (1998). “Global Stochastic Optimization for Partitioning,” in Advances in Data Science and Classification, eds. A. Rizzi et al., Berlin: Springer, pp. 185–190.
Trejos, J., and Castillo, W. (2000). “Simulated Annealing Optimization for Two-Mode Partitioning,” in Classification and Information Processing at the Turn of the Millenium, eds. W. Gaul and R. Decker, Berlin: Springer, pp. 133–142.
Trejos, J., and Piza, E. (2001). “Critères et Heuristiques d’Optimisation pour la Classification de Données Binaires,” in Journées de la Société Francophone de Classification, Guadeloupe, pp. 331–338.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Trejos, J., Murillo, A., Piza, E. (2004). Clustering by Ant Colony Optimization. In: Banks, D., McMorris, F.R., Arabie, P., Gaul, W. (eds) Classification, Clustering, and Data Mining Applications. Studies in Classification, Data Analysis, and Knowledge Organisation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17103-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-17103-1_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22014-5
Online ISBN: 978-3-642-17103-1
eBook Packages: Springer Book Archive