An efficient hybrid evolutionary optimization algorithm based on PSO and SA for clustering

TLDR: In this paper, a hybrid evolutionary programming based clustering algorithm, called PSO-SA, was proposed by combining particle swarm optimization (PSO) and simulated annealing (SA), which increased the information exchange among particles using a mutation operator to escape local optima.

Abstract: The K-means algorithm is one of the most popular techniques in clustering. Nevertheless, the performance of the K-means algorithm depends highly on initial cluster centers and converges to local minima. This paper proposes a hybrid evolutionary programming based clustering algorithm, called PSO-SA, by combining particle swarm optimization (PSO) and simulated annealing (SA). The basic idea is to search around the global solution by SA and to increase the information exchange among particles using a mutation operator to escape local optima. Three datasets, Iris, Wisconsin Breast Cancer, and Ripley’s Glass, have been considered to show the effectiveness of the proposed clustering algorithm in providing optimal clusters. The simulation results show that the PSO-SA clustering algorithm not only has a better response but also converges more quickly than the K-means, PSO, and SA algorithms.