Database Paper Browser

Back to papers

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
3368
Venue
SIGMOD
Year
2002
Pagerank
7.1630476e-05
Overall Rank
3,376 | 76.52%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Previous Page 1 / 1 Next

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.

Previous Page 1 / 1 Next

Semantically Similar Papers