A review on particle swarm optimization algorithms and their applications to data clustering

  • Authors:
  • Sandeep Rana;Sanjay Jasola;Rajesh Kumar

  • Affiliations:
  • School of ICT, Gautam Buddha University, Greater Noida, India;School of ICT, Gautam Buddha University, Greater Noida, India;Department of Electrical Engineering, Malaviya National Institute of Technology, Jaipur, India

  • Venue:
  • Artificial Intelligence Review
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Data clustering is one of the most popular techniques in data mining. It is a method of grouping data into clusters, in which each cluster must have data of great similarity and high dissimilarity with other cluster data. The most popular clustering algorithm K-mean and other classical algorithms suffer from disadvantages of initial centroid selection, local optima, low convergence rate problem etc. Particle Swarm Optimization (PSO) is a population based globalized search algorithm that mimics the capability (cognitive and social behavior) of swarms. PSO produces better results in complicated and multi-peak problems. This paper presents a literature survey on the PSO application in data clustering. PSO variants are also described in this paper. An attempt is made to provide a guide for the researchers who are working in the area of PSO and data clustering.