K-Means Clustering Algorithm Based on Chaotic Adaptive Artificial Bee Colony

• Published in: Algorithms
• Main Authors: Qibing Jin, Nan Lin, Yuming Zhang
• Format: Article
• Language: English
• Published: MDPI AG 2021-02-01
• Subjects: artificial bee colony (ABC) algorithm; K-means clustering (KMC) algorithm; chaos algorithm; Metropolis algorithm; simulated annealing
• Online Access: https://www.mdpi.com/1999-4893/14/2/53

K-Means Clustering is a popular technique in data analysis and data mining. To remedy the defects of relying on the initialization and converging towards the local minimum in the K-Means Clustering (KMC) algorithm, a chaotic adaptive artificial bee colony algorithm (CAABC) clustering algorithm is presented to optimally partition objects into K clusters in this study. This algorithm adopts the max–min distance product method for initialization. In addition, a new fitness function is adapted to the KMC algorithm. This paper also reports that the iteration abides by the adaptive search strategy, and Fuch chaotic disturbance is added to avoid converging on local optimum. The step length decreases linearly during the iteration. In order to overcome the shortcomings of the classic ABC algorithm, the simulated annealing criterion is introduced to the CAABC. Finally, the confluent algorithm is compared with other stochastic heuristic algorithms on the 20 standard test functions and 11 datasets. The results demonstrate that improvements in CAABA-K-means have an advantage on speed and accuracy of convergence over some conventional algorithms for solving clustering problems.