Hybrid Gbest-guided Artificial Bee Colony for hard partitional clustering

  • J. PrakashEmail author
  • P. K. Singh
Original Article


Clustering is an unsupervised classification method in the field of data mining and plays an essential role in applications in diverse fields. The K-means and K-Medoids are popular examples of conventional partitional clustering methods, which have been prominently applied in various applications. However, they possess several disadvantages, e.g., final solution is dependent on the initial solution, they easily struck into a local optimum solution. The nature-inspired swarm intelligence (SI) methods are global search optimization methods, which offer to be effective to overcome deficiencies of the conventional methods as they possess several desired key features like upgrading the candidate solutions iteratively, decentralization, parallel nature, and a self organizing behavior. The Artificial Bee Colony (ABC) algorithm is one of the recent and well-known SI method, which has been shown effective in various real-world problems. However, it exhibits lack of balance in the exploration and exploitation and shows a poor convergence speed when the number of features (dimensions) increases. Therefore, we make two modifications in it to enhance its exploration and exploitation capabilities to improve quality of the clustering. First, we introduce a gbest-guided search procedure for the fast convergence, which works effectively in large number of features also as it considers all the dimensions simultaneously. Second, in order to avoid being trapped in a local optima and to enhance the information exchange (social learning) between bees for improved search, we incorporate a crossover operator of the genetic algorithm (GA) into it. The proposed strategy is named as Hybrid Gbest-guided Artificial Bee Colony (HGABC) algorithm. We compare clustering results of the HGABC with ABC, variants of the ABC and other recent competitive methods in the swarm and evolutionary intelligence domain on ten real and two synthetic data sets using external quality measures F-measure and Rand-index. The obtained results demonstrate superiority of the proposed method over its competitors in terms of efficiency and effectiveness.


Artificial Bee Colony Data clustering Swarm intelligence Hybrid methods Crossover 


  1. Abraham A, Das S, Roy S (2008) Swarm intelligence algorithms for data clustering. In: Maimon O, Rokach L (eds) Soft computing for knowledge discovery and data mining. Springer, Berlin, pp 279–313CrossRefGoogle Scholar
  2. Bahrololoum A, Nezamabadi-pour H, Saryazdi S (2015) A data clustering approach based on universal gravity rule. Eng Appl Artif Intell 45:415–428CrossRefGoogle Scholar
  3. Bandyopadhyay S, Maulik U (2002) An evolutionary technique based on k-means algorithm for optimal clustering. Inf Sci 146(1):221–237MathSciNetCrossRefzbMATHGoogle Scholar
  4. Bansal JC, Sharma H, Jadon SS (2013) Artificial bee colony algorithm: a survey. Int J Adv Intell Paradig 5(1–2):123–159CrossRefGoogle Scholar
  5. Bansal JC, Sharma H, Jadon SS, Clerc M (2014) Spider monkey optimization algorithm for numerical optimization. Memet Comput 6(1):31–47CrossRefGoogle Scholar
  6. Bezdek J (1981) Pattern recognition with fuzzy objective function algorithms. Plenum Press, New YorkCrossRefzbMATHGoogle Scholar
  7. Chang WL, Zeng D, Chen RC, Guo S (2015) An artificial bee colony algorithm for data collection path planning in sparse wireless sensor networks. Int J Mach Learn Cybern 6(3):375–383CrossRefGoogle Scholar
  8. Chuang LY, Hsiao CJ, Yang CH (2011) Chaotic particle swarm optimization for data clustering. Expert Syst Appl 38(12):14555–14563CrossRefGoogle Scholar
  9. Clerc M (2012) Standard particle swarm optimisation. descriptions
  10. Dash M, Liu H (1997) Feature selection for classification. Intell Data Anal 1(3):131–156CrossRefGoogle Scholar
  11. Dorigo M, Stützle T (2003) The ant colony optimization metaheuristic: algorithms, applications, and advances. In: Glover F, Kochenberger GA (eds) Handbook of metaheuristics. Springer, Berlin, pp 250–285Google Scholar
  12. Ester M, Kriegel HP, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. KDD 96:226–231Google Scholar
  13. Friedman M (1937) The use of ranks to avoid the assumption of normality implicit in the analysis of variance. J Am Stat Assoc 32(200):675–701CrossRefzbMATHGoogle Scholar
  14. Gao KZ, Suganthan PN, Pan QK, Tasgetiren MF, Sadollah A (2016) Artificial bee colony algorithm for scheduling and rescheduling fuzzy flexible job shop problem with new job insertion. Knowl-Based Syst 109:1–16CrossRefGoogle Scholar
  15. Gao WF, Liu SY, Huang LL (2013) A novel artificial bee colony algorithm with powell’s method. Appl Soft Comput 13(9):3763–3775CrossRefGoogle Scholar
  16. Goldberg D (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley Publishing Company Inc, BostonzbMATHGoogle Scholar
  17. Goldberg DE, Deb K (1991) A comparative analysis of selection schemes used in genetic algorithms. Urbana 51(61):801–2996Google Scholar
  18. Hansen P, Jaumard B (1997) Cluster analysis and mathematical programming. Math Program 79(1–3):191–215MathSciNetzbMATHGoogle Scholar
  19. Holland JH (1975) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. University of Michigan Press, Ann ArborzbMATHGoogle Scholar
  20. Hruschka ER, Campello RJGB, Freitas AA, De Carvalho APLF (2009) A survey of evolutionary algorithms for clustering. IEEE Trans Syst Man Cybern Part C Appl Rev 39(2):133–155CrossRefGoogle Scholar
  21. Jadon SS, Bansal JC, Tiwari R, Sharma H (2014) Artificial bee colony algorithm with global and local neighborhoods. Int J Syst Assur Eng Manag 1:1–13Google Scholar
  22. Jadon SS, Tiwari R, Sharma H, Bansal JC (2017) Hybrid artificial bee colony algorithm with differential evolution. Appl Soft Comput 58:11–24CrossRefGoogle Scholar
  23. Jain AK, Dubes RC (1988) Algorithms for clustering data. Prentice-Hall, Inc., Englewood CliffszbMATHGoogle Scholar
  24. Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv (CSUR) 31(3):264–323CrossRefGoogle Scholar
  25. Jensi R, Jiji GW (2016) An improved krill herd algorithm with global exploration capability for solving numerical function optimization problems and its application to data clustering. Appl Soft Comput 46:230–245CrossRefGoogle Scholar
  26. Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Technical Report TR06, Erciyes Univ Press, ErciyesGoogle Scholar
  27. Karaboga D, Akay B (2009) A comparative study of artificial bee colony algorithm. Appl Math Comput 214(1):108–132MathSciNetzbMATHGoogle Scholar
  28. Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39(3):459–471MathSciNetCrossRefzbMATHGoogle Scholar
  29. Karaboga D, Gorkemli B (2014) A quick artificial bee colony (qABC) algorithm and its performance on optimization problems. Appl Soft Comput 23:227–238CrossRefGoogle Scholar
  30. Karaboga D, Ozturk C (2011) A novel clustering approach: artificial bee colony (ABC) algorithm. Appl Soft Comput 11(1):652–657CrossRefGoogle Scholar
  31. Kaufman L, Rousseeuw P (1987) Clustering by means of medoids. In: Statistical data analysis based on the L1-norm and related methods, North–HollandGoogle Scholar
  32. Kennedy J, Eberhart R et al (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks, Perth, Australia, vol 4, pp 1942–1948Google Scholar
  33. Kıran MS, Fındık O (2015) A directed artificial bee colony algorithm. Appl Soft Comput 26:454–462CrossRefGoogle Scholar
  34. Kishor A, Singh PK, Prakash J (2016) NSABC: non-dominated sorting based multi-objective artificial bee colony algorithm and its application in data clustering. Neurocomputing 216:514–533CrossRefGoogle Scholar
  35. Liu J, Zhu H, Ma Q, Zhang L, Xu H (2015) An artificial bee colony algorithm with guide of global and local optima and asynchronous scaling factors for numerical optimization. Appl Soft Comput 37:608–618CrossRefGoogle Scholar
  36. Michalski RS, Stepp RE (1983) Automated construction of classifications: conceptual clustering versus numerical taxonomy. IEEE Trans Pattern Anal Mach Intell 4:396–410CrossRefGoogle Scholar
  37. Murtagh F (1983) A survey of recent advances in hierarchical clustering algorithms. Comput J 26(4):354–359CrossRefzbMATHGoogle Scholar
  38. Pakrashi A, Chaudhuri BB (2016) A kalman filtering induced heuristic optimization based partitional data clustering. Inf Sci 369:704–717CrossRefGoogle Scholar
  39. Powell MJD (1977) Restart procedures for the conjugate gradient method. Math Program 12(1):241–254MathSciNetCrossRefzbMATHGoogle Scholar
  40. Prakash J, Singh P (2015) An effective multiobjective approach for hard partitional clustering. Memet Comput 7(2):93–104CrossRefGoogle Scholar
  41. Prakash J, Singh PK (2012) Partitional algorithms for hard clustering using evolutionary and swarm intelligence methods: a survey. In: BIC-TA (2), pp 515–528Google Scholar
  42. Prakash J, Singh PK (2014a) An effective hybrid method based on de, ga, and k-means for data clustering. In: Proceedings of the second international conference on soft computing for problem solving (SocProS 2012), December 28–30, 2012, Springer, pp 1561–1572Google Scholar
  43. Prakash J, Singh PK (2014) Evolutionary and swarm intelligence methods for partitional hard clustering. In: 2014 international conference on information technology (ICIT), IEEE, pp 264–269Google Scholar
  44. Rand WM (1971) Objective criteria for the evaluation of clustering methods. J Am Stat Assoc 66(336):846–850CrossRefGoogle Scholar
  45. Sharma H, Bansal JC, Arya K (2013) Opposition based lévy flight artificial bee colony. Memet Comput 5(3):213–227CrossRefGoogle Scholar
  46. Srinivas M, Patnaik LM (1994) Genetic algorithms: a survey. Computer 27(6):17–26CrossRefGoogle Scholar
  47. Storn R, Price K (1997) Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341–359MathSciNetCrossRefzbMATHGoogle Scholar
  48. Xiang WL, An MQ (2013) An efficient and robust artificial bee colony algorithm for numerical optimization. Comput Oper Res 40(5):1256–1265MathSciNetCrossRefzbMATHGoogle Scholar
  49. Yan X, Zhu Y, Zou W, Wang L (2012) A new approach for data clustering using hybrid artificial bee colony algorithm. Neurocomputing 97:241–250CrossRefGoogle Scholar
  50. Yan X, Zhu Y, Chen H, Zhang H (2013) A novel hybrid artificial bee colony algorithm with crossover operator for numerical optimization. Nat Comput 14(1):1–16MathSciNetGoogle Scholar
  51. Zhang C, Ouyang D, Ning J (2010) An artificial bee colony approach for clustering. Expert Syst Appl 37(7):4761–4767CrossRefGoogle Scholar
  52. Zhu G, Kwong S (2010) Gbest-guided artificial bee colony algorithm for numerical function optimization. Appl Math Comput 217(7):3166–3173MathSciNetzbMATHGoogle Scholar

Copyright information

© The Society for Reliability Engineering, Quality and Operations Management (SREQOM), India and The Division of Operation and Maintenance, Lulea University of Technology, Sweden 2017

Authors and Affiliations

  1. 1.Amity UniversityNoidaIndia
  2. 2.Computational Intelligence and Data Mining Research LabABV-Indian Institute of Information Technology and ManagementGwaliorIndia

Personalised recommendations