Evaluating Clustering in Subspace Projections of High Dimensional Data

Summary: Systematic benchmark of subspace clustering in high-dimensional data. Evaluates paradigms under a common framework; addresses ground-truth absence, varied metrics, and cross-paradigm comparison; provides real/synthetic datasets and repeatable baselines. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: ha89987a4feff2c8a
Venue: VLDB
Year: 2009
Pagerank: 5.2348773e-05
Overall Rank: 8,970 | 39.88%
DOI: 10.14778/1687627.1687770

Incoming Non-self Citations Over Time

Authors

1. Emmanuel Müller (RWTH Aachen University)
2. Stephan Günnemann (RWTH Aachen University)
3. Ira Assent (Aalborg University)
4. Thomas Seidl (RWTH Aachen University)

BibTeX Citation

@article{muller_vldb09,
        title = {{Evaluating Clustering in Subspace Projections of High Dimensional Data}},
        author = {Müller, Emmanuel and Günnemann, Stephan and Assent, Ira and Seidl, Thomas},
        journal = {PVLDB},
        series = {{VLDB} '09},
        doi = {10.14778/1687627.1687770},
        url = {https://doi.org/10.14778/1687627.1687770},
        year = {2009}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
7,525	On the Efficiency of K-Means Clustering: Evaluation, Optimization, and Algorithm Selection	2021	VLDB	5.4868603e-05
14,075	CoDA: Interactive Cluster Based Concept Discovery	2010	VLDB	-

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.

Rank	Cited Paper	Year	Venue	Pagerank
29	Fast Algorithms for Mining Association Rules	1994	VLDB	0.00051028332
165	Mining Frequent Patterns without Candidate Generation	2000	SIGMOD	0.00027323925
310	Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications	1998	SIGMOD	0.00021410542
1,685	Fast Algorithms for Projected Clustering	1999	SIGMOD	9.8713731e-05
1,893	Finding Generalized Projected Clusters in High Dimensional Spaces	2000	SIGMOD	9.4048477e-05
3,627	A Monte Carlo Algorithm for Fast Projective Clustering	2002	SIGMOD	7.1290231e-05
7,401	LB_Keogh Supports Exact Indexing of Shapes under Rotation Invariance with Arbitrary Representations and Distance Measures	2006	VLDB	5.5184506e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	3,750	Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering	1999	VLDB
2	12,911	Constrained Locally Weighted Clustering	2008	VLDB
3	13,152	A Shrinking-Based Approach for Multi-Dimensional Data Analysis	2003	VLDB
4	9,485	A Framework for Projected Clustering of High Dimensional Data Streams	2004	VLDB
5	8,942	Advancing Data Clustering via Projective Clustering Ensembles	2011	SIGMOD
6	14,357	Design and Analysis of Subspace Clustering Algorithms and their Applicability	2002	VLDB
7	1,685	Fast Algorithms for Projected Clustering	1999	SIGMOD
8	13,101	k-Means Projective Clustering	2004	PODS
9	12,940	Detecting Clusters in Moderate-to-High Dimensional Data: Subspace Clustering, Pattern-based Clustering, and Correlation Clustering	2008	VLDB
10	1,893	Finding Generalized Projected Clusters in High Dimensional Spaces	2000	SIGMOD