Hybrid clustering algorithm based on artificial bee colony and K-means algorithm
Xiaojun Bi, Gong Ru-jiang
Abstract
Xiaojun Bi, Gong Ru-jiang
Abstract
The traditional K-means clustering algorithm is too dependent on the initial clustering centers.With regards to this,this paper proposed a mixed clustering method based on the improvement artificial colony algorithm and the K-means algorithm.The new method combined the advantages of regulating ability of global optimization and local optimization with rapid convergence of K-means clustering algorithm to improve the robustness of the algorithm.Experiments show that the clustering result of the new method is significantly improved,not only the stability.
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.
The traditional K-means clustering algorithm is too dependent on the initial clustering centers.With regards to this,this paper proposed a mixed clustering method based on the improvement artificial colony algorithm and the K-means algorithm.The new method combined the advantages of regulating ability of global optimization and local optimization with rapid convergence of K-means clustering algorithm to improve the robustness of the algorithm.Experiments show that the clustering result of the new method is significantly improved,not only the stability.
Key concepts: Cluster analysis, Computer science, Artificial bee colony algorithm, Canopy clustering algorithm, Algorithm, CURE data clustering algorithm, Convergence (economics), Robustness (evolution)