Sciweavers

Share
CIDM
2007
IEEE

Scalable Clustering for Large High-Dimensional Data Based on Data Summarization

9 years 2 months ago
Scalable Clustering for Large High-Dimensional Data Based on Data Summarization
Clustering large data sets with high dimensionality is a challenging data-mining task. This paper presents a framework to perform such a task efficiently. It is based on the notion of data space reduction, which finds high density areas, or dense cells, in the given feature space. The dense cells store summarized information of the data. A designated partitioning or hierarchical clustering algorithm can be used as the second step to find clusters based on the data summaries. Using Kmeans as an example, this paper presents GARDEN-Kmeans, which performs data space reduction using Gamma Region DENsity partition, and utilizes Kmeans to cluster the summarized information. The experimental study shows that GARDEN-Kmeans executes several orders of magnitude faster than basic Kmeans and the recursive bisection Kmeans algorithm of CLUTO, while producing comparable clustering quality.
Ying Lai, Ratko Orlandic, Wai Gen Yee, Sachin Kulk
Added 02 Jun 2010
Updated 02 Jun 2010
Type Conference
Year 2007
Where CIDM
Authors Ying Lai, Ratko Orlandic, Wai Gen Yee, Sachin Kulkarni
Comments (0)
books