A Hybrid Particle Swarm Optimization Algorithm for Clustering Analysis

Clustering is a very important problem that has been addressed in many contexts and by researchers in many disciplines. This paper presents a new stochastic nature inspired methodology, which is based on the concepts of Particle Swarm Optimization (PSO) and Greedy Randomized Adaptive Search Procedure (GRASP), for optimally clustering N objects into K clusters. The proposed algorithm (Hybrid PSO-GRASP) for the solution of the clustering problem is a two phase algorithm which combines a PSO algorithm for the solution of the feature selection problem and a GRASP for the solution of the clustering problem. Due to the nature of stochastic and population-based search, the proposed algorithm can overcome the drawbacks of traditional clustering methods. Its performance is compared with other popular stochastic/ metaheuristic methods like genetic algorithms and tabu search. Results from the application of the methodology to a survey data base coming from the Paris olive oil market and to data sets from the UCI Machine Learning Repository are presented.

[1]  Magdalene Marinaki,et al.  Optimization of nearest neighbor classifiers via metaheuristic algorithms for credit risk assessment , 2008, J. Glob. Optim..

[2]  Shing I. Chang,et al.  Determination of cluster number in clustering microarray data , 2005, Appl. Math. Comput..

[3]  Panos M. Pardalos,et al.  Expanding Neighborhood GRASP for the Traveling Salesman Problem , 2005, Comput. Optim. Appl..

[4]  Siddheswar Ray,et al.  Determination of Number of Clusters in K-Means Clustering and Application in Colour Image Segmentation , 2000 .

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

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

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

[8]  Anil K. Jain,et al.  Data clustering: a review , 1999, CSUR.

[9]  Anil K. Jain,et al.  Feature Selection: Evaluation, Application, and Small Sample Performance , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

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

[11]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[12]  Nikolaos F. Matsatsinis,et al.  Multicriteria analysis in agricultural marketing: The case of French olive oil market , 2001, Eur. J. Oper. Res..

[13]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

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

[15]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .