Clustering with Set Outliers and Applications in Relational Clustering

Summary: Defines k-center clustering with set outliers—can discard up to z candidate subsets H to model structured noise (faulty sources, corrupted join tuples). Presents first tri-criteria approximations (≤2k centers, ≤2fz sets, constant-factor cost), near-linear geometric algorithms, coresets for f=1, hardness barrier and applications to relational clustering (join-result and input-tuple outliers). (summarized by gpt-5-mini on Feb 11 2026)

Paper ID: 1992
Venue: PODS
Year: 2026
Pagerank: 4.1945683e-05
Overall Rank: 10,003 | 30.42%
DOI: 10.1145/3767712

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 13 of 13 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
834	Learning Linear Regression Models over Factorized Joins	2016	SIGMOD	0.00016135159
850	Scaling Factorization Machines to Relational Data	2013	VLDB	0.00015955971
1,167	Learning Generalized Linear Models Over Normalized Data	2015	SIGMOD	0.00013547713
1,546	KATARA: A Data Cleaning System Powered by Knowledge Bases and Crowdsourcing	2015	SIGMOD	0.00011446851
3,715	Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries	2020	VLDB	6.8220943e-05
4,083	Solving k-center Clustering (with Outliers) in MapReduce and Streaming, almost as Accurately as Sequentially	2019	VLDB	6.4638932e-05
5,858	Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries	2021	PODS	5.2997454e-05
7,166	Ranked Enumeration of Join Queries with Projections	2022	VLDB	4.8124491e-05
7,195	Towards Tractability of the Diversity of Query Answers: Ultrametrics to the Rescue	2024	PODS	4.8037242e-05
8,061	Efficient Computation of Quantiles over Joins	2023	PODS	4.5943269e-05
10,924	Improved Approximation Algorithms for Relational Clustering	2024	PODS	4.1945683e-05
10,927	Computing A Well-Representative Summary of Conjunctive Query Results	2024	PODS	4.1945683e-05
10,961	Faster Algorithms for Fair Max-Min Diversification in Rd	2024	SIGMOD	4.1945683e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
1,860	Approximation Algorithms for Clustering Uncertain Data	2008	PODS	0.0001028857
10,927	Computing A Well-Representative Summary of Conjunctive Query Results	2024	PODS	4.1945683e-05
10,923	k-Clustering with Comparison and Distance Oracles	2024	PODS	4.1945683e-05
9,420	Local Search Methods for k-Means with Outliers	2017	VLDB	4.3441378e-05
9,684	How to Design Robust Algorithms using Noisy Comparison Oracle	2021	VLDB	4.3047774e-05
774	Algorithms for Mining Distance-Based Outliers in Large Datasets	1998	VLDB	0.00016865771
701	Efficient Algorithms for Mining Outliers from Large Data Sets	2000	SIGMOD	0.00017938417
4,083	Solving k-center Clustering (with Outliers) in MapReduce and Streaming, almost as Accurately as Sequentially	2019	VLDB	6.4638932e-05
9,924	On Saving Outliers for Better Clustering over Noisy Data	2021	SIGMOD	4.2544238e-05
10,924	Improved Approximation Algorithms for Relational Clustering	2024	PODS	4.1945683e-05