Ant-Based Clustering and Topographic Mapping

Ant-based clustering and sorting is a nature-inspired heuristic first introduced as a model for explaining two types of emergent behavior observed in real ant colonies. More recently, it has been applied in a data-mining context to perform both clustering and topographic mapping. Early work demonstrated some promising characteristics of the heuristic but did not extend to a rigorous investigation of its capabilities. We describe an improved version, called ATTA, incorporating adaptive, heterogeneous ants, a time-dependent transporting activity, and a method (for clustering applications) that transforms the spatial embedding produced by the algorithm into an explicit partitioning. ATTA is then subjected to the most rigorous experimental evaluation of an ant-based clustering and sorting algorithm undertaken to date: we compare its performance with standard techniques for clustering and topographic mapping using a set of analytical evaluation functions and a range of synthetic and real data collections. Our results demonstrate the ability of ant-based clustering and sorting to automatically identify the number of clusters inherent in a data collection, and to produce high quality solutions; indeed, we show that it is particularly robust for clusters of differing sizes and for overlapping clusters. The results obtained for topographic mapping are, however, disappointing. We provide evidence that the solutions generated by the ant algorithm are barely topology-preserving, and we explain in detail why results havein spite of thisbeen misinterpreted (much more positively) in previous research.

[1]  Bastien Chopard,et al.  Formation of an ant cemetery: swarm intelligence or statistical accident? , 2002, Future Gener. Comput. Syst..

[2]  Fabien Picarougne,et al.  A New Approach of Data Clustering Using a Flock of Agents , 2007, Evolutionary Computation.

[3]  Baldo Faieta,et al.  Exploratory database analysis via self-organization , 1994 .

[4]  Julia Handl,et al.  Ant-based and swarm-based clustering , 2007, Swarm Intelligence.

[5]  Pascale Kuntz,et al.  A Stochastic Heuristic for Visualising Graph Clusters in a Bi-Dimensional Space Prior to Partitioning , 1999, J. Heuristics.

[6]  Baldo Faieta,et al.  Diversity and adaptation in populations of clustering ants , 1994 .

[7]  Teuvo Kohonen,et al.  Self-Organizing Maps , 2010 .

[8]  D. J. Newman,et al.  UCI Repository of Machine Learning Database , 1998 .

[9]  Monique Snoeck,et al.  Classification With Ant Colony Optimization , 2007, IEEE Transactions on Evolutionary Computation.

[10]  Pascale Kuntz,et al.  Emergent colonization and graph partitioning , 1994 .

[11]  Robert Tibshirani,et al.  Estimating the number of clusters in a data set via the gap statistic , 2000 .

[12]  Barbara Webb,et al.  Swarm Intelligence: From Natural to Artificial Systems , 2002, Connect. Sci..

[13]  J. Kruskal Nonmetric multidimensional scaling: A numerical method , 1964 .

[14]  Christopher J. Merz,et al.  UCI Repository of Machine Learning Databases , 1996 .

[15]  Juan Julián Merelo Guervós,et al.  Self-Organized Stigmergic Document Maps: Environment as a Mechanism for Context Learning , 2004, ArXiv.

[16]  Jean-Louis Deneubourg,et al.  The dynamics of collective sorting robot-like ants and ant-like robots , 1991 .

[17]  Alexander Dekhtyar,et al.  Information Retrieval , 2018, Lecture Notes in Computer Science.

[18]  Weng-Kin Lai,et al.  Homogeneous Ants for Web Document Similarity Modeling and Categorization , 2002, Ant Algorithms.

[19]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[20]  Esa Alhoniemi,et al.  SOM Toolbox for Matlab 5 , 2000 .

[21]  J. MacQueen Some methods for classification and analysis of multivariate observations , 1967 .

[22]  E. Voorhees The Effectiveness & Efficiency of Agglomerative Hierarchic Clustering in Document Retrieval , 1985 .

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

[24]  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 .

[25]  Marco Dorigo,et al.  On the Performance of Ant-based Clustering , 2003, HIS.

[26]  Michalis Vazirgiannis,et al.  Quality Scheme Assessment in the Clustering Process , 2000, PKDD.

[27]  Julia Handl,et al.  Improved Ant-Based Clustering and Sorting , 2002, PPSN.

[28]  Anil K. Jain,et al.  Data clustering: a review , 1999, CSUR.

[29]  Miguel Á. Carreira-Perpiñán,et al.  Continuous latent variable models for dimensionality reduction and sequential data reconstruction , 2001 .

[30]  D. Snyers,et al.  New results on an ant-based heuristic for highlighting the organization of large graphs , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

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

[32]  Marco Dorigo,et al.  Strategies for the Increased Robustness of Ant-Based Clustering , 2003, Engineering Self-Organising Systems.

[33]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.