SPARCL: Efficient and Effective Shape-Based Clustering
Chaoji, V.
Al Hasan, M.
Salem, S.
Zaki, M.J.
Dept. of Comput. Sci., Rensselaer Polytech. Inst., Troy, NY;
This paper appears in: Data Mining, 2008. ICDM '08. Eighth IEEE International Conference on
Publication Date: 15-19 Dec. 2008
On page(s): 93-102
Location: Pisa,
ISSN: 1550-4786
ISBN: 978-0-7695-3502-9
INSPEC Accession Number: 10472146
Digital Object Identifier: 10.1109/ICDM.2008.73
Current Version Published: 2009-02-10
Abstract
Clustering is one of the fundamental data mining tasks. Many different clustering paradigms have been developed over the years, which include partitional, hierarchical, mixture model based, density-based, spectral, subspace, and so on. The focus of this paper is on full-dimensional, arbitrary shaped clusters. Existing methods for this problem suffer either in terms of the memory or time complexity (quadratic or even cubic). This shortcoming has restricted these algorithms to datasets of moderate sizes. In this paper we propose SPARCL, a simple and scalable algorithm for finding clusters with arbitrary shapes and sizes, and it has linear space and time complexity. SPARCL consists of two stages - the first stage runs a carefully initialized version of the K-means algorithm to generate many small seed clusters. The second stage iteratively merges the generated clusters to obtain the final shape-based clusters. Experiments were conducted on a variety of datasets to highlight the effectiveness, efficiency, and scalability of our approach. On the large datasets SPARCL is an order of magnitude faster than the best existing approaches.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
