Database Paper Browser

Back to papers

Design and Analysis of Subspace Clustering Algorithms and their Applicability

Summary: Subspace clustering in high dimensions; surveys CLIQUE, ENCLUS, PROCLUS, MAFIA; three-step workflow: identify dense subspaces, cluster via dense units, describe clusters compactly. Emphasizes efficiency (fewer passes, smaller candidate sets) and sampling-based validation, plus extensions for mixed-type data, constraints, census-style tasks, and streaming. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
8944
Venue
VLDB
Year
2002
Pagerank
-
Overall Rank
13,800 | 4.00%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers