Improved Artificial Bee Colony Clustering Algorithm Based on K-Means
Xue Mei Wang, Jin Bo Wang
Abstract
Xue Mei Wang, Jin Bo Wang
Abstract
According to the defects of classical k-means clustering algorithm such as sensitive to the initial clustering center selection, the poor global search ability, falling into the local optimal solution. Artificial Bee Colony algorithm based on K-means was introduced in this article, then put forward an improved Artificial Bee Colony algorithm combined with k-means clustering algorithm at the same time. The experiments showed that the method has solved algorithm stability of k-means clustering algorithm well, and more effectively improved clustering quality and property.
OpenAlex reports 10 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.
According to the defects of classical k-means clustering algorithm such as sensitive to the initial clustering center selection, the poor global search ability, falling into the local optimal solution. Artificial Bee Colony algorithm based on K-means was introduced in this article, then put forward an improved Artificial Bee Colony algorithm combined with k-means clustering algorithm at the same time. The experiments showed that the method has solved algorithm stability of k-means clustering algorithm well, and more effectively improved clustering quality and property.
Key concepts: Cluster analysis, Artificial bee colony algorithm, CURE data clustering algorithm, Canopy clustering algorithm, Stability (learning theory), Computer science, Correlation clustering, Determining the number of clusters in a data set