Back to Search
Start Over
Automatic Subspace Clustering of High Dimensional Data.
- Source :
- Data Mining & Knowledge Discovery; Jul2005, Vol. 11 Issue 1, p5-33, 29p, 5 Black and White Photographs, 4 Charts, 9 Graphs
- Publication Year :
- 2005
-
Abstract
- 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 clusters descriptions in the form of DNF expression 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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 13845810
- Volume :
- 11
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- Data Mining & Knowledge Discovery
- Publication Type :
- Academic Journal
- Accession number :
- 18055811
- Full Text :
- https://doi.org/10.1007/s10618-005-1396-1