An improved clustering algorithm based on improved artificial bee colony and K-means algorithms
List of Authors
  • Lim Eng Aik , Tan Wee Choon

Keyword
  • K-means, algorithm, clustering, bee colony algorithm

Abstract
  • To overcome the shortcomings of the K-means clustering algorithm, an improved artificial bee colony algorithm is proposed. By adding a dynamic adjustment factor to the honey source search strategy, the algorithm can automatically adjust the search range in different evolutionary periods, enhancing the algorithm's global search ability and local exploitation ability. The central solution idea, which contains more optimal solution information, is introduced to improve the swarm's search efficiency and accelerate the algorithm's convergence speed. The improved bee colony algorithm is used to optimise the K-means algorithm to improve the performance of the clustering effect. The simulation results show that the optimised K-means algorithm has strong stability, and the clustering effect has been significantly improved.

Reference
  • 1. Anon, University of California, Irvine (2022). UCI Machine Learning Repository. https://archive.ics.uci.edu/ml/index.php.

    2. Arit, T., Ajchara, P. (2013). A Hybrid Artificial Bee Colony Algorithm with Local Search For Flexible Job-Shop Scheduling Problem, Procedia Computer Science, 20, 96-101.

    3. Batool, I., Khan, T. (2022). Software Fault Prediction Using Data Mining, Machine Learning and Deep Learning Techniques: A Systematic Literature Review, Computers and Electrical Engineering, 100, 107886.

    4. Cao, Y., Cai, Z., Shao, Y. (2014). Improved Artificial Bee Colony Clustering Algorithm Based on K-means, Journal of Computer Applications, 34(1), 204-207.

    5. Deng, H., Qin, H., Sun, X. (2013). K-Means Clustering algorithm with Meliorated Initial Center, Computer Technology and Development, 23, 42-45.

    6. Ghezelbash, R., Magsoudi, A., Carranza, E. (2020). Optimisation of Geochemical Anomaly Detection Using a Novel Genetic K-means Clustering Algorithm, Computer & Geosciences, 134, 104335.

    7. Huang, S., Kang, Z., Xu, Z., Liu, Q. (2021). Robust Deep K-means: An effective and Simple Method for Data Clustering, Pattern Recognition, 117, 107996.

    8. Kumar, M., Reddy, R. (2017). An Efficient K-means Clustering Filtering Algorithm Using Density Based Initial Cluster Centers, Information Sciences, 418, 286-301.

    9. Li, Y., Chu, X., Tian, D., Feng, J., Mu, W. (2021). Customer Segmentation Using K-means clustering and the Adaptive Particle Swarm Optimization Algorithm, Applied Soft Computing, 113, 107924.

    10. Li, H., He, H., Wen, Y. (2015). Dynamic Particle Swarm Optimisation and K-means Clustering Algorithm for Image Segmentation, Optik, 126(24), 4817-4822.

    11. Lozano, M., Rodriguez, F. (2021). Network Reconstruction from Betweenness Centrality by Artificial Bee Colony, Swarm and Evolutionary Computation, 62, 100851.

    12. MacQueen, J. (1967). Some Methods for Classification and Analysis of Multivariate Observations, Proceeding of 5th Berkeley Symposium on Mathematical Statistics and Probability, University of California Press, 1, 281-297.

    13. Yavuz, G., Aydin, D. (2019). Improved Self-Adaptive Search Equation-Based Artificial Bee Colony Algorithm with Competitive Local Search Strategy, Swarm and Evolutionary Computation, 51, 100582.

    14. Yavuz, G., Durmus, B., Aydin, D. (2022). Artificial Bee Colony Algorithm with Distant Savants for Constrained Optimisation, Applied Soft Computing, 116, 108343.

    15. Zhou, C., Mao, L., Wu, B. (2015). Artificial Bee Colony Algorithm Based on Current Optimal Solution, Computer Engineering, 41(6), 147-151.