RACK: RApid Clustering using K-means algorithm

Garg, Vikas K and Murty, MN (2009) RACK: RApid Clustering using K-means algorithm. In: IEEE International Conference on Automation Science and Engineering. CASE 2009, AUG 22-25, 2009, Bangalore, pp. 621-626.

PDF rack.pdf - Published Version Restricted to Registered users only Download (395kB) | Request a copy

Abstract

The k-means algorithm is an extremely popular technique for clustering data. One of the major limitations of the k-means is that the time to cluster a given dataset D is linear in the number of clusters, k. In this paper, we employ height balanced trees to address this issue. Specifically, we make two major contributions, (a) we propose an algorithm, RACK (acronym for RApid Clustering using k-means), which takes time favorably comparable with the fastest known existing techniques, and (b) we prove an expected bound on the quality of clustering achieved using RACK. Our experimental results on large datasets strongly suggest that RACK is competitive with the k-means algorithm in terms of quality of clustering, while taking significantly less time.

Item Type:	Conference Paper
Publisher:	IEEE
Additional Information:	Copyright 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	26 Apr 2010 08:50
Last Modified:	19 Sep 2010 06:00
URI:	http://eprints.iisc.ac.in/id/eprint/27267

Actions (login required)

View Item