An efficient k-means clustering algorithm (1998)
| Venue: | In Proceedings of IPPS/SPDP Workshop on High Performance Data Mining |
| Citations: | 37 - 0 self |
BibTeX
@INPROCEEDINGS{Alsabti98anefficient,
author = {Khaled Alsabti},
title = {An efficient k-means clustering algorithm},
booktitle = {In Proceedings of IPPS/SPDP Workshop on High Performance Data Mining},
year = {1998}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper, we present a novel algorithm for performing k-means clustering. It organizes all the patterns in a k-d tree structure such that one can find all the patterns which are closest to a given prototype efficiently. The main intuition behind our approach is as follows. All the prototypes are potential candidates for the closest prototype at the root level. However, for the children of the root node, we may be able to prune the candidate set by using simple geometrical constraints. This approach can be applied recursively until the size of the candidate set is one for each node. Our experimental results demonstrate that our scheme can improve the computational speed of the direct k-means algorithm by an order to two orders of magnitude in the total number of distance calculations and the overall time of computation. 1.
