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,610 | 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,257	Approximation Algorithms for Co-Clustering	2008	PODS	4.3690661e-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,595	Fast Algorithms for Projected Clustering	1999	SIGMOD	0.00011222442
7,113	Answering Planning Queries with the Crowd	2013	VLDB	4.8274062e-05
12,571	k-Means Projective Clustering	2004	PODS	4.1945683e-05
9,257	Approximation Algorithms for Co-Clustering	2008	PODS	4.3690661e-05
6,545	Clustering Uncertain Graphs	2018	VLDB	5.0193115e-05
3,636	Efficient and Effective Algorithms for Clustering Uncertain Graphs	2019	VLDB	6.8976555e-05
5,990	On the Optimality of Clustering Properties of Space Filling Curves	2012	PODS	5.2424347e-05
6,834	A Unified Optimization Algorithm For Solving "Regret-Minimizing Representative" Problems	2020	VLDB	4.9117328e-05
8,547	Advancing Data Clustering via Projective Clustering Ensembles	2011	SIGMOD	4.4937074e-05
1,658	A Stochastic Approach for Clustering in Object Bases	1991	SIGMOD	0.00010980786