High Impact Factor : 4.396 icon | Submit Manuscript Online icon |

A Survey Paper on Improvisation of K-Means Clustering Algorithm with Implementation on E-Commerce Data


Shekh Shabazhusen A. , Growmore Faculty of Engineering; Prof. Ketan Patel, Growmore Faculty of Engineering


Text Summarization, Key phrases Extraction, Text mining, Data Mining and Text compression


Clustering is a technique for primary data analysis and k-means is clustering algorithms which are very useful of all the other algorithms. In data mining clustering methods are frequently used, because its performance in clustering large data sets. The result of the k-means clustering algorithm depends upon the correctness of the initial centroids, because they are selected randomly. The original k-means algorithm converges to local minimum, not the global optimum. Many improvements were already proposed to improve the performance of the k-means, but most of these require additional inputs like threshold values for the number of data points in a set. In this research a new method is proposed for finding the better initial centroids and to provide an efficient way of assigning the data points to suitable clusters with reduced time complexity. Our experimental results show the proposed algorithm more accurate with less computational time comparing to original k-means clustering algorithm.

Other Details

Paper ID: IJSRDV5I10093
Published in: Volume : 5, Issue : 1
Publication Date: 01/04/2017
Page(s): 125-128

Article Preview

Download Article