Issue No.08 - August (2004 vol.16)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2004.25
<p><b>Abstract</b>—K-means is one of the most popular clustering algorithms. This article introduces an efficient disk-based implementation of K-means. The proposed algorithm is designed to work inside a relational database management system. It can cluster large data sets having very high dimensionality. In general, it only requires three scans over the data set. It is optimized to perform heavy disk I/O and its memory requirements are low. Its parameters are easy to set. An extensive experimental section evaluates quality of results and performance. The proposed algorithm is compared against the Standard K-means algorithm as well as the Scalable K-means algorithm.</p>
Clustering, K-means, relational databases, disk.
Carlos Ordonez, Edward Omiecinski, "Efficient Disk-Based K-Means Clustering for Relational Databases", IEEE Transactions on Knowledge & Data Engineering, vol.16, no. 8, pp. 909-921, August 2004, doi:10.1109/TKDE.2004.25