Speeding-Up the K-Means Clustering Method: A Prototype Based Approach

Authors:
T. Hitendra Sarma;P. Viswanath
Affiliations:
Pattern Recognition Research Laboratory, NRI Institute of Tehnology, Guntur, India 522009;Pattern Recognition Research Laboratory, NRI Institute of Tehnology, Guntur, India 522009
Venue:
PReMI '09 Proceedings of the 3rd International Conference on Pattern Recognition and Machine Intelligence
Year:
2009

Citing 4
Cited 1

Data clustering: a review

ACM Computing Surveys (CSUR)
An Efficient k-Means Clustering Algorithm: Analysis and Implementation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Rough-fuzzy weighted k-nearest leader classifier for large data sets

Pattern Recognition
Rough-DBSCAN: A fast hybrid density based clustering method for large data sets

Pattern Recognition Letters

Speeding-up the kernel k-means clustering method: A prototype based hybrid approach

Pattern Recognition Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper is about speeding-up the k-means clustering method which processes the data in a faster pace, but produces the same clustering result as the k-means method. We present a prototype based method for this where prototypes are derived using the leaders clustering method. Along with prototypes called leaders some additional information is also preserved which enables in deriving the k means. Experimental study is done to compare the proposed method with recent similar methods which are mainly based on building an index over the data-set.