Abstract
This paper introduces a set of algorithmic modifications that improve the partitioning results obtained with ant-based clustering. Moreover, general parameter settings and a self-adaptation scheme are devised, which afford the algorithm’s robust performance across varying data sets. We study the sensitivity of the resulting algorithm with respect to two distinct, and generally important, features of data sets: (i) unequal-sized clusters and (ii) overlapping clusters. Results are compared to those obtained using k-means, one-dimensional self-organising maps, and average-link agglomerative clustering. The impressive capacity of ant-based clustering to automatically identify the number of clusters in the data is additionally underlined by comparing its performance to that of the Gap statistic.
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
Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence – From Natural to Artificial Systems. Oxford University Press, New York (1999)
Deneubourg, J.-L., Goss, S., Franks, N., Sendova-Franks, A., Detrain, C., Chrétien, L.: The dynamics of collective sorting: Robot-like ants and ant-like robots. In: Meyer, J.-A., Wilson, S. (eds.) Proceedings of the First International Conference on Simulation of Adaptive Behaviour: From Animals to Animats 1, pp. 356–365. MIT Press, Cambridge (1991)
Handl, J.: Ant-based methods for tasks of clustering and topographic mapping: extensions, analysis and comparison with alternative methods. Masters thesis. Chair of Artificial Intelligence, University of Erlangen-Nuremberg, Germany (November 2003), http://www.handl.julia.de
Handl, J., Meyer, B.: Improved ant-based clustering and sorting in a document retrieval interface. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 913–923. Springer, Heidelberg (2002)
Kohonen, T.: Self-Organizing Maps. Springer, Berlin (1995)
Lumer, E., Faieta, B.: Diversity and adaptation in populations of clustering ants. In: Proceedings of the Third International Conference on Simulation of Adaptive Behaviour: From Animals to Animats 3, pp. 501–508. MIT Press, Cambridge (1994)
MacQueen, L.: Some methods for classification and analysis of multivariate observations. In: LeCam, L., Neyman, J. (eds.) Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, pp. 281–297. University of California Press, Berkeley (1967)
Milligan, G.W.: An examination of procedures for determining the number of clusters in a data set. Psychometrika 50, 159–179 (1985)
Tibshirani, R., Walther, G., Hastie, T.: Estimating the number of clusters in a dataset via the Gap statistic. Technical Report 208, Department of Statistics, Stanford University (2000), http://citeseer.nj.nec.com/tibshirani00estimating.html
van Rijsbergen, C.: Information Retrieval, 2nd edn. Butterworths, London (1979)
Vesanto, J., Himberg, J., Alhoniemi, E., Parkankangas, J.: SOM Toolbox for Matlab 5. Technical Report A57, Neural Networks Research Centre, Helsinki University of Technology, Espoo, Finland (April 2000)
Vorhees, E.: The effectiveness and efficiency of agglomerative hierarchical clustering in document retrieval. PhD thesis, Department of Computer Science, Cornell University, UK (1985)
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
Handl, J., Knowles, J., Dorigo, M. (2004). Strategies for the Increased Robustness of Ant-Based Clustering. In: Di Marzo Serugendo, G., Karageorgos, A., Rana, O.F., Zambonelli, F. (eds) Engineering Self-Organising Systems. ESOA 2003. Lecture Notes in Computer Science(), vol 2977. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24701-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-24701-2_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21201-0
Online ISBN: 978-3-540-24701-2
eBook Packages: Springer Book Archive