A Monte Carlo Algorithm for Fast Projective Clustering

Summary: Monte Carlo algorithm for fast projective clustering, with an optimal density-based subspace formulation and high-probability guarantees. Heuristics speed computation; experiments show improved accuracy vs prior work. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 3430
Venue: SIGMOD
Year: 2002
Pagerank: 7.3200789e-05
Overall Rank: 3,550 | 75.65%
DOI: 10.1145/564691.564739

Incoming Non-self Citations Over Time

Authors

1. Cecilia M. Procopiuc (AT&T)
2. Michael Jones (Mitsubishi Electric Company)
3. Pankaj K. Agarwal (Duke University)
4. T. M. Murali (Boston University)

BibTeX Citation

@inproceedings{procopiuc_sigmod02,
        title = {{A Monte Carlo Algorithm for Fast Projective Clustering}},
        author = {Procopiuc, Cecilia M. and Jones, Michael and Agarwal, Pankaj K. and Murali, T. M.},
        series = {{SIGMOD} '02},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/564691.564739},
        url = {https://dl.acm.org/doi/10.1145/564691.564739},
        year = {2002}
}

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
4,775	triCluster: An Effective Algorithm for Mining Coherent Clusters in 3D Microarray Data	2005	SIGMOD	6.513866e-05
4,856	Computing Clusters of Correlation Connected Objects	2004	SIGMOD	6.4752952e-05
5,500	Combi-Operator – Database Support for Data Mining Applications	2003	VLDB	6.1968585e-05
8,215	CURLER: Finding and Visualizing Nonlinear Correlation Clusters	2005	SIGMOD	5.4651579e-05
8,751	Advancing Data Clustering via Projective Clustering Ensembles	2011	SIGMOD	5.3766157e-05
8,778	Evaluating Clustering in Subspace Projections of High Dimensional Data	2009	VLDB	5.3753402e-05
12,764	k-Means Projective Clustering	2004	PODS	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 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,602	Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces	2000	VLDB	0.00010239526
1,646	Fast Algorithms for Projected Clustering	1999	SIGMOD	0.00010128564
1,833	Finding Generalized Projected Clusters in High Dimensional Spaces	2000	SIGMOD	9.6566846e-05
2,158	What is the nearest neighbor in high dimensional spaces?	2000	VLDB	9.0622995e-05
3,663	Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering	1999	VLDB	7.2151113e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	11,898	Entity Matching with Active Monotone Classification	2018	PODS
2	12,572	Constrained Locally Weighted Clustering	2008	VLDB
3	5,867	Fast Euclidean OPTICS with Bounded Precision in Low Dimensional Space	2018	SIGMOD
4	8,778	Evaluating Clustering in Subspace Projections of High Dimensional Data	2009	VLDB
5	11,161	Efficient Algorithm for K-Multiple-Means	2024	SIGMOD
6	1,833	Finding Generalized Projected Clusters in High Dimensional Spaces	2000	SIGMOD
7	11,664	Fast Density-Peaks Clustering: Multicore-based Parallelization Approach	2021	SIGMOD
8	1,646	Fast Algorithms for Projected Clustering	1999	SIGMOD
9	12,764	k-Means Projective Clustering	2004	PODS
10	8,751	Advancing Data Clustering via Projective Clustering Ensembles	2011	SIGMOD