The dynamics of collective sorting robot-like ants and ant-like robots
Proceedings of the first international conference on simulation of adaptive behavior on From animals to animats
Diversity and adaptation in populations of clustering ants
SAB94 Proceedings of the third international conference on Simulation of adaptive behavior : from animals to animats 3: from animals to animats 3
Swarm intelligence: from natural to artificial systems
Swarm intelligence: from natural to artificial systems
Information Retrieval
Improved Ant-Based Clustering and Sorting
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Ant-Based Clustering and Topographic Mapping
Artificial Life
A general stochastic clustering method for automatic cluster discovery
Pattern Recognition
Hi-index | 0.00 |
In this paper, we provide the reasons why the dissimilarity-scaling parameter (α) in the neighbourhood function of ant-based clustering is critical for detecting the correct number of clusters in data sources. We then examine a recently proposed method named ATTA; we show that there is no need to use a population of α-adaptive ants to reproduce ATTA's results. We devise a method to estimate a fixed (i.e, non-adaptive) single value of α for each dataset. We also introduce a simplified version of ATTA, called SATTA. The reason for introducing SATTA is two-fold: first, to test our proposed α-estimation method; and, second, to simulate ant-based clustering from a purely stochastic perspective. SATTA omits the ant colony but reuses important ant heuristics. Experimental results show that SATTA generally performs better than ATTA on clusters with different densities and clusters that are elongated. Finally, we show that the results can be further improved using a majority voting scheme.