An Efficient Space-Partitioning Based Algorithm for the K-Means Clustering

Authors:
Khaled Alsabti;Sanjay Ranka;Vineet Singh
Affiliations:
-;-;-
Venue:
PAKDD '99 Proceedings of the Third Pacific-Asia Conference on Methodologies for Knowledge Discovery and Data Mining
Year:
1999

Citing 5
Cited 0

Algorithms for clustering data

Algorithms for clustering data
BIRCH: an efficient data clustering method for very large databases

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Elements of artificial neural networks

Elements of artificial neural networks
Large-Scale Parallel Data Clustering

ICPR '96 Proceedings of the International Conference on Pattern Recognition (ICPR '96) Volume IV-Volume 7472 - Volume 7472
Efficient algorithms for data mining

Efficient algorithms for data mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

k-means clustering is a popular clustering method.Its core task of finding the closest prototype for every input pattern involves expensive distance calculations.W e present a novel algorithm for performing this task.Th is and other optimizations are shown to significantly improve the performance of the k-means algorithm.T he resultant algorithm produces the same (except for round-off errors) results as those of the direct algorithm.