The effectiveness and efficiency of agglomerative hierarchic clustering in document retrieval
The effectiveness and efficiency of agglomerative hierarchic clustering in document retrieval
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
Self-organizing maps
Swarm intelligence: from natural to artificial systems
Swarm intelligence: from natural to artificial systems
ACM Computing Surveys (CSUR)
Computational Intelligence: An Introduction
Computational Intelligence: An Introduction
Clustering Validity Assessment: Finding the Optimal Partitioning of a Data Set
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Improved Ant-Based Clustering and Sorting
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Ant Colony Optimization
On the performance of ant-based clustering
Design and application of hybrid intelligent systems
Ant colony optimization of clustering models: Research Articles
International Journal of Intelligent Systems
Ant-Based Clustering and Topographic Mapping
Artificial Life
Aggregation Pheromone Density Based Clustering
ICIT '06 Proceedings of the 9th International Conference on Information Technology
Pattern Recognition, Third Edition
Pattern Recognition, Third Edition
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Use of aggregation pheromone density for image segmentation
Pattern Recognition Letters
An adaptive flocking algorithm for performing approximate clustering
Information Sciences: an International Journal
Aggregation Pheromone Density Based Pattern Classification
Fundamenta Informaticae
On model design for simulation of collective intelligence
Information Sciences: an International Journal
An efficient hybrid algorithm for resource-constrained project scheduling
Information Sciences: an International Journal
Kernel-induced fuzzy clustering of image pixels with an improved differential evolution algorithm
Information Sciences: an International Journal
Ant based semi-supervised classification
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
A time-efficient pattern reduction algorithm for k-means clustering
Information Sciences: an International Journal
A novel ant-based clustering algorithm using the kernel method
Information Sciences: an International Journal
Swarm intelligence based routing protocol for wireless sensor networks: Survey and future directions
Information Sciences: an International Journal
A survey: hybrid evolutionary algorithms for cluster analysis
Artificial Intelligence Review
Arranging cluster sizes and transmission ranges for wireless sensor networks
Information Sciences: an International Journal
A novel approach to probability distribution aggregation
Information Sciences: an International Journal
Information Sciences: an International Journal
Aggregation Pheromone Density Based Pattern Classification
Fundamenta Informaticae
Black hole: A new heuristic optimization approach for data clustering
Information Sciences: an International Journal
Aggregation pheromone metaphor for semi-supervised classification
Pattern Recognition
Hi-index | 0.07 |
Ants, bees and other social insects deposit pheromone (a type of chemical) in order to communicate between the members of their community. Pheromone, that causes clumping or clustering behavior in a species and brings individuals into a closer proximity, is called aggregation pheromone. This article presents a new algorithm (called, APC) for clustering data sets based on this property of aggregation pheromone found in ants. An ant is placed at each location of a data point, and the ants are allowed to move in the search space to find points with higher pheromone density. The movement of an ant is governed by the amount of pheromone deposited at different points of the search space. More the deposited pheromone, more is the aggregation of ants. This leads to the formation of homogenous groups of data. The proposed algorithm is evaluated on a number of well-known benchmark data sets using different cluster validity measures. Results are compared with those obtained using two popular standard clustering techniques namely average linkage agglomerative and k-means clustering algorithm and with an ant-based method called adaptive time-dependent transporter ants for clustering (ATTA-C). Experimental results justify the potentiality of the proposed APC algorithm both in terms of the solution (clustering) quality as well as execution time compared to other algorithms for a large number of data sets.