Data Mining and Knowledge Discovery

, Volume 11, Issue 1, pp 5–33

Automatic Subspace Clustering of High Dimensional Data

  • Rakesh Agrawal
  • Johannes Gehrke
  • Dimitrios Gunopulos
  • Prabhakar Raghavan

DOI: 10.1007/s10618-005-1396-1

Cite this article as:
Agrawal, R., Gehrke, J., Gunopulos, D. et al. Data Min Knowl Disc (2005) 11: 5. doi:10.1007/s10618-005-1396-1


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 cluster descriptions in the form of DNF expressions that are minimized for ease of comprehension. It produces identical results irrespective of the order in which input records are presented and does not presume any specific mathematical form for data distribution. Through experiments, we show that CLIQUE efficiently finds accurate clusters in large high dimensional datasets.


subspace clusteringclusteringdimensionality reduction

Copyright information

© Springer Science + Business Media, Inc. 2005

Authors and Affiliations

  • Rakesh Agrawal
    • 1
  • Johannes Gehrke
    • 2
  • Dimitrios Gunopulos
    • 3
  • Prabhakar Raghavan
    • 4
  1. 1.IBM Almaden Research CenterSan Jose
  2. 2.Computer Science DepartmentCornell UniversityIthaca
  3. 3.Department of Computer Science and Eng.University of California RiversideRiverside
  4. 4.Verity, Inc.Germany