Programmable Clustering

Summary: Introduce "programmable clustering": users specify acceptable clusterings via first-order logic formulas rather than an explicit objective. Show the general problem can be NP-hard but identify three FO specifications that admit efficient algorithms and give solutions. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 1407
Venue: PODS
Year: 2006
Pagerank: -
Overall Rank: 13,623 | 5.32%
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 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
9,262	Approximation Algorithms for Co-Clustering	2008	PODS	4.3648789e-05

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
1,596	Fast Algorithms for Projected Clustering	1999	SIGMOD	0.00011210688
12,580	k-Means Projective Clustering	2004	PODS	4.1905499e-05
7,112	Answering Planning Queries with the Crowd	2013	VLDB	4.8227734e-05
6,522	Clustering Uncertain Graphs	2018	VLDB	5.0230003e-05
9,262	Approximation Algorithms for Co-Clustering	2008	PODS	4.3648789e-05
3,622	Efficient and Effective Algorithms for Clustering Uncertain Graphs	2019	VLDB	6.9021704e-05
5,972	On the Optimality of Clustering Properties of Space Filling Curves	2012	PODS	5.2462762e-05
6,816	A Unified Optimization Algorithm For Solving "Regret-Minimizing Representative" Problems	2020	VLDB	4.9115662e-05
8,544	Advancing Data Clustering via Projective Clustering Ensembles	2011	SIGMOD	4.4893996e-05
1,657	A Stochastic Approach for Clustering in Object Bases	1991	SIGMOD	0.00010975412