Finding generalized projected clusters in high dimensional spaces
Top Cited Papers
- 16 May 2000
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 29 (2) , 70-81
- https://doi.org/10.1145/342009.335383
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Entropy-based subspace clustering for mining numerical dataPublished by Association for Computing Machinery (ACM) ,1999
- Fast algorithms for projected clusteringPublished by Association for Computing Machinery (ACM) ,1999
- Dimensionality reduction for similarity searching in dynamic databasesPublished by Association for Computing Machinery (ACM) ,1998
- Automatic subspace clustering of high dimensional data for data mining applicationsPublished by Association for Computing Machinery (ACM) ,1998
- CUREPublished by Association for Computing Machinery (ACM) ,1998
- Approximate nearest neighborsPublished by Association for Computing Machinery (ACM) ,1998
- Two algorithms for nearest-neighbor search in high dimensionsPublished by Association for Computing Machinery (ACM) ,1997
- BIRCHPublished by Association for Computing Machinery (ACM) ,1996
- FastMapPublished by Association for Computing Machinery (ACM) ,1995
- Principal Component AnalysisPublished by Springer Nature ,1986