A New Algorithm for Clustering Based on Particle Swarm Optimization and K-means

  • Authors:
  • Jinxin Dong;Minyong Qi

  • Affiliations:
  • -;-

  • Venue:
  • AICI '09 Proceedings of the 2009 International Conference on Artificial Intelligence and Computational Intelligence - Volume 04
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Clustering is a technique that can divide data objects into meaningful groups. Particle swarm optimization is an evolutionary computation technique developed through a simulation of simplified social models. K-means is one of the popular unsupervised learning clustering algorithms. After analyzing particle swarm optimization and K-means algorithm, a new hybrid algorithm based on both algorithms is proposed. In the new algorithm, the next solution of the problem is generated by the better one of PSO and K-means but not PSO itself. It can make full use of the advantages of both algorithms, and can avoid shortcomings of both algorithms. The experimental results show the effectiveness of the new algorithm.