• DOI:10.1007/s10618-005-1396-1
Corpus ID: 9289572

Automatic Subspace Clustering of High Dimensional Data

@article{Agrawal2005AutomaticSC,
  title={Automatic Subspace Clustering of High Dimensional Data},
  author={R. Agrawal and J. Gehrke and D. Gunopulos and P. Raghavan},
  journal={Data Mining and Knowledge Discovery},
  year={2005},
  volume={11},
  pages={5-33}
}

R. Agrawal, J. Gehrke, +1 author P. Raghavan

Published 2005

Mathematics, Computer Science

Data Mining and Knowledge Discovery

Data mining applications place special requirements on clustering algorithms including: the ability to find clusters embedded in subspaces of high dimensional data, scalability, end-user comprehensibility of the results, non-presumption of any canonical data distribution, and insensitivity to the order of input records. We present CLIQUE, a clustering algorithm that satisfies each of these requirements. CLIQUE identifies dense clusters in subspaces of maximum dimensionality. It generates… CONTINUE READING

View on Springer

cs.cornell.edu

Save to Library

Create Alert

Cite

Launch Research Feed