A Divide-and-Merge Methodology for Clustering

Summary: Divide-and-merge clustering: spectral top-down divide builds a tree of items; bottom-up merge efficiently finds optimal tree-respecting partitions for many objectives (k-means, min-diameter, min-sum, correlation). Applied to web meta-search and text data, competitive or superior to prior methods. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 1353
Venue: PODS
Year: 2005
Pagerank: -
Overall Rank: 13,644 | 5.09%
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

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

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
10,943	Efficient Algorithm for K-Multiple-Means	2024	SIGMOD	4.1945683e-05
4,817	Clustering by Pattern Similarity in Large Data Sets	2002	SIGMOD	5.8987807e-05
313	Graph Clustering Based on Structural/Attribute Similarities	2009	VLDB	0.00028097557
1,595	Fast Algorithms for Projected Clustering	1999	SIGMOD	0.00011222442
13,926	Clustering Methods for Large Databases: From the Past to the Future	1999	SIGMOD	-
11,852	K-means Split Revisited: Well-grounded Approach and Experimental Evaluation	2016	SIGMOD	4.1945683e-05
10,924	Improved Approximation Algorithms for Relational Clustering	2024	PODS	4.1945683e-05
8,168	Evaluating Clustering in Subspace Projections of High Dimensional Data	2009	VLDB	4.5701004e-05
12,623	Data Bubbles for Non-Vector Data: Speeding-up Hierarchical Clustering in Arbitrary Metric Spaces	2003	VLDB	4.1945683e-05
11,045	Ensemble Clustering based on Meta-Learning and Hyperparameter Optimization	2024	VLDB	4.1945683e-05