Database Paper Browser

Back to papers

Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering

Summary: OptiGrid introduces optimal grid-partitioning for high-dimensional clustering, selecting dimension-wise hyperplane splits via projections to beat the curse of dimensionality. It outperforms condensation-based methods like BIRCH, offering a solid mathematical basis, improved effectiveness in high dimensions, and scalable efficiency on large real datasets (CAD, molecular biology). (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
8594
Venue
VLDB
Year
1999
Pagerank
7.0614822e-05
Overall Rank
3,475 | 75.83%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank Citing Paper Year Venue Pagerank
1,372 SQLEM: Fast Clustering in SQL using the EM Algorithm 2000 SIGMOD 0.00012318334
3,030 DADA: A Data Cube for Dominant Relationship Analysis 2006 SIGMOD 7.6794959e-05
3,376 A Monte Carlo Algorithm for Fast Projective Clustering 2002 SIGMOD 7.1630476e-05
5,079 Combi-Operator – Database Support for Data Mining Applications 2003 VLDB 5.7140516e-05
6,883 C2P: Clustering based on Closest Pairs 2001 VLDB 4.8960306e-05
7,829 CURLER: Finding and Visualizing Nonlinear Correlation Clusters 2005 SIGMOD 4.6400142e-05
12,571 k-Means Projective Clustering 2004 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 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