Memetic Particle Gravitation Optimization Algorithm for Solving Clustering Problems

Abstract

Data clustering is a well-known data analysis technique for organizing unlabeled datapoints into clusters on the basis of similarity measures. The real-world applications of data clustering include bioinformatics, vector quantization, data mining, geographical information systems, pattern recognition, image processing, and wireless sensors. The data in a cluster are similar (minimizing the intra-cluster distance) and differ from the data in other clusters (maximizing the inter-cluster distance). The cluster problem has been proven to be NP-hard, but can be solved using meta-heuristic algorithms, such as ant colony optimization, genetic algorithms, gravitational search algorithm (GSA), and particle swarm optimization (PSO). This paper proposes a memetic clustering algorithm with efficient search and fast convergence, respectively, based on PSO and GSA, called the memetic particle gravitation optimization (MPGO) algorithm. The two main mechanisms of MPGO are hybrid operation and diversity enhancement. The former involves the exchange of individuals from two subpopulations after a predefined number of function evaluations (FEs), whereas the latter involves an enhancement operator, which is similar to the crossover process of differential evolution, for enhancing the diversity of each system. Individuals from the PSO and GSA systems are selected for the exchange of solutions by using the roulette-wheel approach. The performance of the proposed algorithm was evaluated on 52 benchmark test functions, six UCI machine learning benchmarks, and image segmentation of six well-known images. A comparison with existing algorithms verified the superior performance of the proposed algorithm in terms of a fitness value, an accuracy rate, and a peak signal-to-noise ratio.