Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

An Efficient Algorithm for Solving Data Clustering Problems


Affiliations
1 Bannari Amman Institute of Technology, Sathyamangalam, Tamil Nadu, India
     

   Subscribe/Renew Journal


This paper presents a new data clustering algorithm called KPSO algorithm, a combination on K-means and Particle swarm Optimization algorithms. Unlike traditional K-means method, KPSO need not specify the number of clusters to be given prior the clustering process and is able to find the optimal number of clusters during the clustering process. In each and every iteration of KPSO, a discrete PSO is used to optimize the number of clusters with which the K-means is used to find the best clustering result.

Keywords

Data Clustering, K-Means, Particle Swarm Optimization, Clustering Process.
User
Subscription Login to verify subscription
Notifications
Font Size

Abstract Views: 257

PDF Views: 4




  • An Efficient Algorithm for Solving Data Clustering Problems

Abstract Views: 257  |  PDF Views: 4

Authors

K. Karthika
Bannari Amman Institute of Technology, Sathyamangalam, Tamil Nadu, India
G. Komarasamy
Bannari Amman Institute of Technology, Sathyamangalam, Tamil Nadu, India

Abstract


This paper presents a new data clustering algorithm called KPSO algorithm, a combination on K-means and Particle swarm Optimization algorithms. Unlike traditional K-means method, KPSO need not specify the number of clusters to be given prior the clustering process and is able to find the optimal number of clusters during the clustering process. In each and every iteration of KPSO, a discrete PSO is used to optimize the number of clusters with which the K-means is used to find the best clustering result.

Keywords


Data Clustering, K-Means, Particle Swarm Optimization, Clustering Process.