Fast Algorithms for Projected Clustering
Summary: Projected clustering in high-dimensional data: clusters live in cluster-specific subspaces instead of a single global feature set. Introduces a general algorithmic framework to discover these subspaces and assign points accordingly, with evaluation on synthetic data. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Charu C. Aggarwal (IBM)
- 2. Cecilia Procopiuc (Duke University)
- 3. Joel L. Wolf (IBM)
- 4. Philip S. Yu (IBM)
- 5. Jong Soo Park (Sungshin Women's University)
BibTeX Citation
@inproceedings{aggarwal_sigmod99,
title = {{Fast Algorithms for Projected Clustering}},
author = {Aggarwal, Charu C. and Procopiuc, Cecilia and Wolf, Joel L. and Yu, Philip S. and Park, Jong Soo},
series = {{SIGMOD} '99},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/304182.304188},
url = {https://dl.acm.org/doi/10.1145/304182.304188},
year = {1999}
}
Incoming Citations (Sorted by Pagerank)
Showing 18 of 18 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 31 | BIRCH: An Efficient Data Clustering Method for Very Large Databases | 1996 | SIGMOD | 0.00050347119 |
| 88 | Efficient and Effective Clustering Methods for Spatial Data Mining | 1994 | VLDB | 0.00035240327 |
| 304 | Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications | 1998 | SIGMOD | 0.00021917388 |
| 351 | CURE: An Efficient Clustering Algorithm for Large Databases | 1998 | SIGMOD | 0.00020424271 |
| 1,137 | A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space | 1997 | PODS | 0.00012027131 |
| 1,713 | Clustering Categorical Data: An Approach Based on Dynamical Systems | 1998 | VLDB | 9.94811e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 304 | Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications | 1998 | SIGMOD |
| 2 | 2,158 | What is the nearest neighbor in high dimensional spaces? | 2000 | VLDB |
| 3 | 14,127 | Clustering Methods for Large Databases: From the Past to the Future | 1999 | SIGMOD |
| 4 | 8,751 | Advancing Data Clustering via Projective Clustering Ensembles | 2011 | SIGMOD |
| 5 | 14,001 | Design and Analysis of Subspace Clustering Algorithms and their Applicability | 2002 | VLDB |
| 6 | 12,602 | Detecting Clusters in Moderate-to-High Dimensional Data: Subspace Clustering, Pattern-based Clustering, and Correlation Clustering | 2008 | VLDB |
| 7 | 9,272 | A Framework for Projected Clustering of High Dimensional Data Streams | 2004 | VLDB |
| 8 | 12,764 | k-Means Projective Clustering | 2004 | PODS |
| 9 | 8,778 | Evaluating Clustering in Subspace Projections of High Dimensional Data | 2009 | VLDB |
| 10 | 1,833 | Finding Generalized Projected Clusters in High Dimensional Spaces | 2000 | SIGMOD |