Strategies for the Increased Robustness of Ant-Based Clustering
- 454 Downloads
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.
KeywordsGrid Cell Data Item Agglomerative Cluster Neighbourhood Function Picking Operation
Unable to display preview. Download preview PDF.
- 2.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)Google Scholar
- 3.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
- 5.Kohonen, T.: Self-Organizing Maps. Springer, Berlin (1995)Google Scholar
- 6.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)Google Scholar
- 7.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)Google Scholar
- 9.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
- 10.van Rijsbergen, C.: Information Retrieval, 2nd edn. Butterworths, London (1979)Google Scholar
- 11.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)Google Scholar
- 12.Vorhees, E.: The effectiveness and efficiency of agglomerative hierarchical clustering in document retrieval. PhD thesis, Department of Computer Science, Cornell University, UK (1985)Google Scholar