Comparative Analysis of K-Means and Enhanced K-Means Algorithms for Clustering

Authors

  • Manoj Pokharel Central Department of Computer Science and IT, Tribhuvan University, Nepal
  • Jagdish Bhatta Central Department of Computer Science and IT, Tribhuvan University, Nepal
  • Nawaraj Paudel Central Department of Computer Science and IT, Tribhuvan University, Nepal

DOI:

https://doi.org/10.3126/nutaj.v8i1-2.44044

Keywords:

Clustering, Data Mining, Elbow Method, Enhanced K-means, K-means

Abstract

Clustering in data mining is a way of organizing a set of objects in such a way that the objects in same bunch are more comparable and relevant to each other than to those objects in other bunches.

In the modern information retrieval system, clustering algorithms are better if they result high quality clusters in efficient time. This study includes analysis of clustering algorithms k-means and enhanced k-means algorithm over the wholesale customers and wine data sets respectively. In this research, the enhanced k-means algorithm is found to be 5% faster for wholesale customers dataset for 4 clusters and 49%, 38% faster when the clusters size is increased to 8 and 13 respectively. The wholesale customers dataset when classified with 18 clusters the speedup was seen to be 29%. Similarly, in the case of wine dataset, the speed up is seen to be 10%, 30%, 49%, and 41% for 3, 8, 13 and 18 clusters respectively. Both of the algorithms are found very similar in terms of the clustering accuracy.

Downloads

Download data is not yet available.
Abstract
110
PDF
64

Downloads

Published

2021-12-31

How to Cite

Pokharel, M., Bhatta, J., & Paudel, N. (2021). Comparative Analysis of K-Means and Enhanced K-Means Algorithms for Clustering. NUTA Journal, 8(1-2), 79–87. https://doi.org/10.3126/nutaj.v8i1-2.44044

Issue

Section

Articles