A novel discrete particle swarm clustering algorithm for data clustering

Authors:
R. Karthi;S. Arumugam;K. RameshKumar
Affiliations:
Amrita Vishwa Vidyapeetham, India;Nandha College of Engineering, Erode, India;Amrita Vishwa Vidyapeetham, India
Venue:
Proceedings of the 2nd Bangalore Annual Compute Conference
Year:
2009

Citing 5
Cited 0

Pattern classification with genetic algorithms

Pattern Recognition Letters - Special issue on genetic algorithms
Data clustering: a review

ACM Computing Surveys (CSUR)
An evolutionary technique based on K-means algorithm for optimal clustering in RN

Information Sciences—Applications: An International Journal
Differential evolution and particle swarm optimisation in partitional clustering

Computational Statistics & Data Analysis
Survey of clustering algorithms

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a novel Discrete Particle Swarm Clustering algorithm (DPSC) for data clustering has been proposed. The particle positions and velocities are defined in a discrete form and an efficient approach is developed to move the particles for constructing new clustering solutions. DPSC algorithm has been applied to solve the data clustering problems by considering two performance metrics, such as TRace Within criteria (TRW) and Variance Ratio Criteria (VRC). The result obtained by the proposed algorithm has been compared with the published results of Combinatorial Particle Swarm Optimization (CPSO) algorithm and Genetic Algorithm (GA). The performance analysis demonstrates the effectiveness of the proposed algorithm in solving the partitional data clustering problems.