A Hybrid Bumble Bees Mating Optimization - GRASP Algorithm for Clustering

A new hybrid algorithm for clustering, which is based on the concepts of the Bumble Bees Mating Optimization (BBMO) and Greedy Randomized Adaptive Search Procedure (GRASP), is presented in this paper. The proposed algorithm is a two phase algorithm which combines a new algorithm called Bumble Bees Mating Optimization algorithm for the solution of the feature selection problem and a GRASP algorithm for the solution of the clustering problem. The performance of the algorithm is compared with other popular metaheuristic and nature inspired methods using datasets from the UCI Machine Learning Repository. The high performance of the proposed algorithm is achieved as the algorithm gives very good results and in some instances the percentage of the correct clustered samples is very high and is larger than 98%.

[1]  Thomas Stützle,et al.  Ant Colony Optimization , 2009, EMO.

[2]  Lior Rokach,et al.  Data Mining And Knowledge Discovery Handbook , 2005 .

[3]  Hussein A. Abbass,et al.  A Monogenous MBO Approach to Satisfiability , 2001 .

[4]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[5]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[6]  Rui Xu,et al.  Survey of clustering algorithms , 2005, IEEE Transactions on Neural Networks.

[7]  Magdalene Marinaki,et al.  A Hybrid Clustering Algorithm Based on Honey Bees Mating Optimization and Greedy Randomized Adaptive Search Procedure , 2008, LION.