Abstract
This paper provides a novel clustering algorithm named CEABC (Comprehensively Enhanced Artificial Bee Colony Algorithm), enhanced by multiple operators including K-means, PSO and directed by Gbest mechanism is proposed, which can be used to solve clustering problem. In the initial stage, the algorithm uses K-means operator to generate the initial nectar source, which not only improves the quality of the initial nectar source, but also avoids the problem of low operating efficiency. In order to enhance the interaction between individuals, the concept of global optimum solution which can also be called Gbest is introduced, where the original one-dimensional information exchange is replaced by the full-dimensional information exchange among nectar sources, so that the information exchange volume of the whole swarm can be improved. In the phase of bee scouting, the above-mentioned global optimal solution is combined with PSO algorithm to generate a brand-new nectar source search method, which will enhance the ability of ABC algorithm to develop nectar sources. Meanwhile, the global optimal solution will continue to guide the bee scouting to generate new nectar sources so as to improve the overall quality of the nectar sources. Then, the experiment carried out on two sets of artificial data sets and four sets of UCI machine learning data sets which are the most representative verifies the clustering performance of the newly proposed CEABC algorithm. In addition, the experimental results are compared with standard ABC algorithm, several other newly proposed ABC-improved algorithms and classical clustering algorithms. Results clearly show that the novel ABC algorithm described in this paper has better accuracy and stability in solving clustering problems, which is a more effective clustering algorithm. We believe that clustering method for high-dimensional data can provide an effective method for data processing in materials, medical treatment, automatic driving and other application fields.
Similar content being viewed by others
References
Basturk, B., Karaboga, D.: An Artificial Bee Colony (ABC) algorithm for numeric function optimization. In: IEEE Swarm Intelligence Symposium, Indiana, USA, (2006)
Bohat, V.K., Arya, K.V.: An effective gbest-guided gravitational search algorithm for real-parameter optimization and its application in training of feedforward neural networks. Knowl. Based Syst. 143, 192–207 (2018)
Cacciari, M., Salam, G.P.: The anti-kt jet clustering algorithm. J. High Energy Phys. (2008)
Chen, H., Zhu, Y., Hu, K.: “Cooperative bacterial foraging optimization.” Discr. Dyn. Nat. Soc. 2009, 17 (2009)
Chen, Z., Zhang, L., Tian, G., Nasr, E.A.: Economic maintenance planning of complex systems based on discrete artificial bee colony algorithm. IEEE Access 8, 108062–108071 (2020). https://doi.org/10.1109/ACCESS.2020.2999601
Chen, Q., Sun, J., Palade, V.: Hierarchical clustering based band selection algorithm for hyperspectral face recognition. IEEE Access 7 (2019)
Cui, L., Li, G., Zhu, Z.: A novel artificial bee colony algorithm with an adaptive population size for numerical function optimization. Inf. Sci. 414, 53–67 (2017)
Dai, Q.Z., Xiong, Z.Y., Xie, J., Wang, X.X.: A novel clustering algorithm based on the natural reverse nearest neighbor structure. Inf. Syst. 84, 1–6 (2019)
Dan, J.: The application of artificial bee colony (ABC) algorithm in FIR filter design. In: International Conference on Natural Computation (2016)
De Falco, I., Cioppa, A. Della, Tarantino, E.: Facing classifification problems with Particle Swarm Optimization. Appl. Soft Comput. 7 (3), 652–658 (2007)
Demiroz, G., Guvenir, A.: Classification by voting feature intervals. In: Proceedings of the Seventh European Conference on Machine Learning , pp. 85–92 (1997)
Dorigo, M., Stutzle, T.: Ant Colony Optimization. MIT Press, Cambridge, Mass, USA (2004)
Fahy, C., Yang, S.: Ant colony stream clustering: a fast density clustering algorithm for dynamic data streams. IEEE Trans. Cybern. 49(6), 2215–2218 (2018)
Gao, W.F., Huang, L.L., Liu, S.Y., Dai, C.: Artificial bee colony algorithm based on information learning. IEEE Trans. Cybern. 45(12), 2827–2839 (2015)
Gao, W.F., Liu, S.Y., Huang, L.L.: A novel artifificial bee colony algorithm based on modifified search equation and orthogonal learning. IEEE Trans. Syst. Man Cybern. Part B 43, 1011–1024 (2013)
Hu, R., Wang, H., Feng, D.: Trustworthy services selection based on preference recommendation. J. Softw. 22(5), 852–864 (2011)
Hassoun, M.H.: Fundamentals of artificial neural networks. The MIT Press, Cambridge, MA (1995)
Holland, J.H.: Adaptation in natural and artifificial systems: an introductory analysis with applications to biology, control, and artifificial intelligence. University of Michigan Press, Michigan (1975)
Hooke, R., Jeeves, T.A.: Direct search solution of numerical and statistical problems. J. ACM 8(2), 212–229 (1961). https://doi.org/10.1145/321062.321069
Horng, S.C.: Combining artificial bee colony with ordinal optimization for stochastic economic lot scheduling problem. IEEE Trans. Syst. Man Cybern. Syst. (2019) https://doi.org/10.1109/TSMC.2014.2351783
http://archive.ics.uci.edu/ml/. Accessed 21 Apr 2019
Huang, F., Li, X., Zhang, S., Zhang, J.: Harmonious genetic clustering. IEEE Trans Cybern. 48(1), 199–214 (2018). https://doi.org/10.1109/TCYB.2016.2628722. Epub 2017 Jan 5
Huang, K.W., Wu, Z.X., Peng, H.W., Tsai, M.C.: Memetic particle gravitation optimization algorithm for solving clustering problems. IEEE Access 7, 80950–80968 (2019)
Hung, W.L., Yang, J.H., Song, I.W.: A modified self-updating clustering algorithm for application to dengue gene expression data. Commun. Stat. Simul. Comput. (2019)
Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: a review. Acm Comput. Surv. 31(3), 264–323 (1999)
Jain, A., Dubes, R.: Algrithms for clustering data. Prentice-Hall, Englewood Cliffs, NJ (1998)
Jensen, F.: An introduction to Bayesian networks. UCL Press/Springer–Verlag (1996)
Kamel, N., Ouchen, I., Baali, K.: A sampling-PSO-K-means algorithm for document clustering. Genetic and Evolutionary Computing, pp. 45–54
Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J. Glob. Optim. 39(3), 459–471 (2007)
Karaboga, D., Gorkemli, B., Ozturk, C., Karaboga, N.: A comprehensive survey: artifificial bee colony (ABC) algorithm and applications
Karaboga, D., Basturk, B.: Artificial Bee Colony (ABC) optimization algorithm for solving constrained optimization problems. LNCS: Advances in Soft Computing: Foundations of Fuzzy Logic and Soft Computing, vol. 4529, Springer-Verlag, pp. 789–798 (2007)
Karaboga, D., Ozturk, C.: A novel clustering approach: artificial bee colony(ABC) algorithm. Appl. Soft Comput. 11(1), 652–657 (2011)
Karaboga, D.: An idea based on honey bee swarm for numerical optimization, Technical Report-TR06. Erciyes University, Engineering Faculty, Computer Engineering Department (2005)
Karaboga, D., Ozturk, C.: A novel clustering approach: artificial bee colony(ABC) algorithm. Appl. Soft Comput. 11(1), 652–657 (2011)
Kennedy, J., Eberhart, R.: “Particle swarm optimization”. In: Proceedings of the IEEE International Conference on Neural Networks, pp. 1942–1948 (1995)
Krishnamoorthi, M., Natarajan, A.M.: ABK-means: an algorithm for data clustering using ABC and K-means algorithm. Int. J. Comput. Sci. Eng. 8(4), 383–391 (2013)
Kumar, Y., Sahoo, G.: A two-step artifificial bee colony algorithm for clustering. Neural Comput. Appl. 28, 537–551 (2017)
Leung, Y.W., Wang, Y.: An orthogonal genetic algorithm with quantization for global numerical optimization. IEEE Trans. Evol. Comput. 5(1), 41–53 (2001)
Łukasik, M., García-Martínez, C., Rodríguez, F.J., Trujillo, H.M.: Optimizing network attacks by artifificial bee colony. Inf. Sci. (2016)
Luo, J., Liu, Q., Yang, Y., Li, X., Chen, M.R., Cao, W.: An artificial bee colony algorithm for multi-objective optimisation. Appl. Soft Comput. 50, 235–251 (2017)
Ma, W., Sun, Z., Li, J., Song, M., Lang, X.: An improved artifificial bee colony algorithm based on the strategy of global reconnaissance. Soft Comput. 20, 4825–4857 (2016)
MacQueen, J.: Some methods for classifification and analysis of multivariate observations. In: Proc. 5th Berkeley Symp. Math. Stat. Probability, pp. 281–297 (1967)
Ozturk, C., Hancer, E., Karaboga, D.: A novel binary artificial bee colony algorithm based on genetic operators. Inf. Sci. 297, 154–170 (2015)
Potter, M. A., de Jong, K. A.: “A cooperative coevolutionary approach to function optimization”. In: Proceedings of the 3rd Conference on Parallel Problem Solving from Nature. Springer, Berlin, Germany, pp. 249–257 (1994)
Prakash, J., Singh, P.K., Kishor, A.: Integrating fitness predator optimizer with multi-objective PSO for dynamic partitional clustering. Prog. Artif. Intell. 8, 83–99 (2019)
Selvi, C., Sivasankar, E.: A novel optimization algorithm for recommender system using modified fuzzy c-means clustering approach. Soft Comput. 23, 1901–1916 (2019)
Shah, H., et al.: “A quick gbest guided artificial bee colony algorithm for stock market prices prediction”. Symmetry 10(7), 292 (2018)
Shen, X., Qi, Y., Ma, T., Zhou, Z.: A dicentric chromosome identification method based on clustering and watershed algorithm. Sci. Reports. 9, 2285 (2019)
Soruri, M., Sadri, J., Zahiri, S.H.: Gene clustering with hidden Markov model optimized by PSO algorithm. Pattern Anal. Appl. 21, 1121–1126 (2018)
Sriadhi, S., Gultom, S., Martiano, M., Rahim, R., Abdullah D.: K-Means method with linear search algorithm to reduce means square error (MSE) within data clustering. In: 3rd Annual Applied Science and Engineering Conference (2018)
Sun, H., Wang, K., Zhao, J., Yu, X.: Artificial bee colony algorithm with improved special centre. Int. J. Comput. Sci. Math. 7(6), 548 (2016). https://doi.org/10.1504/IJCSM.2016.081698
Lukasik, S., Kowalski, P.A., Charytanowicz, M., Kulczycki, P.: Clustering using flower pollination algorithm and Calinski-Harabasz index. 2016 IEEE Congress on Evolutionary Computation (CEC) 978-1-5090-0623-6/16/\$31.00
van den Bergh, F., Engelbrecht, A.P.: A cooperative approach to participle swam optimization. IEEE Trans. Evol. Comput. 8(3), 225–239 (2004)
Van Lierde, H., Chen, G.: Chow, T.W.S,: Scalable spectral clustering for overlapping community detection in large-scale networks. IEEE Trans. Knowl. Data Eng. 32(4), 754–767 (2019)
Webb, G.I.: Multiboosting: a technique for combining boosting and wagging. Mach. Learn. 40(2), 159–196 (2000)
Qiang, X., Shuang-Shuang, Y.: Clustering algorithm for urban taxi carpooling vehicle based on data field energy. J. Adv. Transp. 2018, 8
Yan, X., Zhu, Y., Zou, W., Wang, L.: A new approach for data, clustering using hybrid artificial bee colony algorithm. Neurocomputing 97, 241–250 (2012)
Zhang, C., Ouyang, D., Ning, J.: An artificial bee colony approach for clustering. Expert Syst. Appl. 37, 4761–4767 (2010)
Zhang, Y., et al.: “Cost-sensitive feature selection using two-archive multi-objective artificial bee colony algorithm”. Expert Syst. Appl. 137, 46–58 (2019)
Wang, Z., Wang, K., Pan, S., Han, Y.: Segmentation of crop disease images with an improved K-means clustering algorithm. Appl. Eng. Agric. 34(2), 277–289 (2018)
Zhu, G., Kwong, S.: Gbest-guided artifificial bee colony, algorithm for numerical function optimization. Appl. Math. Comput. 217(7), 3166–3173 (2010)
Zou, W., Zhu, Y., Chen, H., Sui, X.: A clustering approach using cooperative artificial bee colony algorithm. Discr. Dyn. Nat. Soc. 2010, 16
Acknowledgements
This work was supported in part by The National Nature Science Foundation of China (No. 31971311),in part by The National Social Science Fund of China(NO.20BGL251)
Author information
Authors and Affiliations
Corresponding authors
Ethics declarations
Conflict of interest
We declare that we have no conflict of interest
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Pu, Q., Xu, C., Wang, H. et al. A novel artificial bee colony clustering algorithm with comprehensive improvement. Vis Comput 38, 1395–1410 (2022). https://doi.org/10.1007/s00371-021-02367-0
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00371-021-02367-0