A New Clustering Algorithm Based on Hybrid Ant Colony Algorithm
Jingyu Yang
Abstract
Jingyu Yang
Abstract
An optimization model of clustering problem is given in this paper.The advantages and shortages of K-Means algorithm,simulated annealing algorithm and basic ant colony algorithm are analyzed.The algorithm is then extended to use K-means clustering to seed the initial solution and the information pheromone is adjusted according to them.All the 2 hybrid ant colony algorithms are proved effective and especially the second hybrid algorithm is a best algorithm than others.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
An optimization model of clustering problem is given in this paper.The advantages and shortages of K-Means algorithm,simulated annealing algorithm and basic ant colony algorithm are analyzed.The algorithm is then extended to use K-means clustering to seed the initial solution and the information pheromone is adjusted according to them.All the 2 hybrid ant colony algorithms are proved effective and especially the second hybrid algorithm is a best algorithm than others.
Key concepts: Computer science, Ant colony optimization algorithms, Algorithm, Cluster analysis, Simulated annealing, Economic shortage, Hybrid algorithm (constraint satisfaction), k-medoids