Computing Clusters of Correlation Connected Objects

Summary: 4C (Computing Correlation Connected Clusters) finds local subgroups with uniform, arbitrarily complex correlations beyond global linear patterns. It blends PCA and DBSCAN to yield determinate, noise-robust clusters and beats DBSCAN, CLIQUE, ORCLUS in tests. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: h1955781504e6bf9a
Venue: SIGMOD
Year: 2004
Pagerank: 6.3080199e-05
Overall Rank: 5,000 | 66.49%
DOI: 10.1145/1007568.1007620

Incoming Non-self Citations Over Time

Authors

1. Christian Böhm (University of Munich)
2. Karin Kailing (University of Munich)
3. Peer Kröger (University of Munich)
4. Arthur Zimek (University of Munich)

BibTeX Citation

@inproceedings{bohm_sigmod04,
        title = {{Computing Clusters of Correlation Connected Objects}},
        author = {Böhm, Christian and Kailing, Karin and Kröger, Peer and Zimek, Arthur},
        series = {{SIGMOD} '04},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1007568.1007620},
        url = {https://dl.acm.org/doi/10.1145/1007568.1007620},
        year = {2004}
}

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
992	DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation	2015	SIGMOD	0.00012621584
6,347	Outlier-robust Clustering using Independent Components	2008	SIGMOD	5.7893117e-05
8,406	CURLER: Finding and Visualizing Nonlinear Correlation Clusters	2005	SIGMOD	5.3223662e-05
12,578	Interactive Data Mining with 3D-Parallel-Coordinate-Trees	2013	SIGMOD	4.9605343e-05
12,940	Detecting Clusters in Moderate-to-High Dimensional Data: Subspace Clustering, Pattern-based Clustering, and Correlation Clustering	2008	VLDB	4.9605343e-05

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
90	The X-tree: An Index Structure for High-Dimensional Data	1996	VLDB	0.00034749222
300	OPTICS: Ordering Points To Identify the Clustering Structure	1999	SIGMOD	0.00021743411
310	Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications	1998	SIGMOD	0.00021410542
1,642	Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces	2000	VLDB	9.9812004e-05
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
4,947	Clustering by Pattern Similarity in Large Data Sets	2002	SIGMOD	6.3284351e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	1,685	Fast Algorithms for Projected Clustering	1999	SIGMOD
2	1,759	Clustering Categorical Data: An Approach Based on Dynamical Systems	1998	VLDB
3	13,813	Scalable Community Detection via Parallel Correlation Clustering	2021	VLDB
4	7,629	Mining Attribute-structure Correlated Patterns in Large Attributed Graphs	2012	VLDB
5	6,347	Outlier-robust Clustering using Independent Components	2008	SIGMOD
6	8,406	CURLER: Finding and Visualizing Nonlinear Correlation Clusters	2005	SIGMOD
7	4,947	Clustering by Pattern Similarity in Large Data Sets	2002	SIGMOD
8	12,911	Constrained Locally Weighted Clustering	2008	VLDB
9	12,940	Detecting Clusters in Moderate-to-High Dimensional Data: Subspace Clustering, Pattern-based Clustering, and Correlation Clustering	2008	VLDB
10	9,115	Multivariate Correlations Discovery in Static and Streaming Data	2022	VLDB