Enhance Clustering Algorithm Using Optimization
DOI:
https://doi.org/10.47607/ijresm.2020.313Keywords:
Clustering, K-means clustering, Particle Swarm ClusteringAbstract
Unsupervised learning can reveal the structure of datasets without being concerned with any labels, K-means clustering is one such method. Traditionally the initial clusters have been selected randomly, with the idea that the algorithm will generate better clusters. However, studies have shown there are methods to improve this initial clustering as well as the K-means process. This paper examines these results on different types of datasets to study if these results hold for all types of data. Another method that is used for unsupervised clustering is the algorithm based on Particle Swarm Optimization. For the second part this paper studies the classic K-means based algorithm and a Hybrid K-means algorithm which uses PSO to improve the results from K-means. The hybrid K-means algorithms are compared to the standard K-means clustering on two benchmark classification problems. In this project we used Kaggle dataset to with different size (small, large and medium) for comparison PSO, k-means and k-means hybrid.
Downloads
Downloads
Published
Issue
Section
License
Copyright (c) 2020 Roshankumar Ramashish Maurya, Anand Khandare
This work is licensed under a Creative Commons Attribution 4.0 International License.