Performance Comparisons of PSO based Clustering

Details Performance Comparisons of PSO based Clustering Performance Comparisons of PSO based Clustering

2010-01-29

arxiv.org/abs/1001.5348v1

InterJRI Computer Science and Networking, Volume 1, pp18-23, 2009

Computer Science

Neural and Evolutionary Computing

6 pages 2 figures

Scientific paper

In this paper we have investigated the performance of PSO Particle Swarm Optimization based clustering on few real world data sets and one artificial data set. The performances are measured by two metric namely quantization error and inter-cluster distance. The K means clustering algorithm is first implemented for all data sets, the results of which form the basis of comparison of PSO based approaches. We have explored different variants of PSO such as gbest, lbest ring, lbest vonneumann and Hybrid PSO for comparison purposes. The results reveal that PSO based clustering algorithms perform better compared to K means in all data sets.

Affiliated with

Also associated with

No associations

Rating

Performance Comparisons of PSO based Clustering does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Performance Comparisons of PSO based Clustering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Performance Comparisons of PSO based Clustering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-676492