DBScholar

Back to papers

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
2053
Venue
PODS
Year
2026
Pagerank
5.093636e-05
Overall Rank
10,176 | 30.19%
DOI
10.1145/3767712

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{surianarayanan_pods26,
        address = {New York, NY, USA},
        series = {{PODS} '26},
        title = {{Clustering with Set Outliers and Applications in Relational Clustering}},
        url = {https://dl.acm.org/doi/10.1145/3767712},
        doi = {10.1145/3767712},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Surianarayanan, Vaishali and Kumar, Neeraj and Sintos, Stavros},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
9,719 Subset Sampling over Joins 2026 PODS 5.2319816e-05
10,153 Faster Relational Algorithms Using Geometric Data Structures 2026 PODS 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 14 of 14 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers