Back close

Neighborhood search assisted particle swarm optimization (NPSO) algorithm for partitional data clustering problems

Publication Type : Journal Article

Publisher : Communications in Computer and Information Science

Source : Communications in Computer and Information Science, vol. 192 CCIS, pp. 552-561, 2011

Url : http://www.scopus.com/inward/record.url?eid=2-s2.0-80051554555&partnerID=40&md5=1a1bf06e0610cbbeee57c6632c3c917b

ISBN : 9783642227196

Keywords : biology, cluster analysis, Clustering algorithms, Data clustering, Genetic algorithms, Marriott Criteria, Particle swarm, Particle swarm optimization (PSO), Trace Within criteria, Variance ratio

Campus : Coimbatore

School : School of Engineering

Department : Computer Science, Mechanical, Mechanical Engineering

Year : 2011

Abstract : New variant of PSO algorithm called Neighborhood search assisted Particle Swarm Optimization (NPSO) algorithm for data clustering problems has been proposed in this paper. We have proposed two neighborhood search schemes and a centroid updating scheme to improve the performance of the PSO algorithm. NPSO algorithm has been applied to solve the data clustering problems by considering three performance metrics, such as TRace Within criteria (TRW), Variance Ratio Criteria (VRC) and Marriott Criteria (MC). The results obtained by the proposed algorithm have been compared with the published results of basic PSO algorithm, Combinatorial Particle Swarm Optimization (CPSO) algorithm, Genetic Algorithm (GA) and Differential Evolution (DE) algorithm. The performance analysis demonstrates the effectiveness of the proposed algorithm in solving the partitional data clustering problems. © 2011 Springer-Verlag.

Cite this Research Publication : R. Karthi, Rajendran, Cb, and K. Ramesh Kumar, “Neighborhood search assisted particle swarm optimization (NPSO) algorithm for partitional data clustering problems”, Communications in Computer and Information Science, vol. 192 CCIS, pp. 552-561, 2011

Admissions Apply Now