Fair and Fast k-Center Clustering for Data Summarization
Haris Angelidakis, Adam Kurpisz, Leon Sering, Rico Zenklusen
Abstract
We consider two key issues faced by many clustering methods when used for data summarization, namely (a) an unfair representation of "demographic groups" and (b) distorted summarizations, where data points in the summary represent subsets of the original data of vastly different sizes. Previous work made important steps towards handling separately each of these two issues in the context of the fundamental k-Center clustering objective through the study of fast algorithms for natural models that address them. We show that it is possible to effectively address both (a) and (b) simultaneously by presenting a clustering procedure that works for a canonical combined model and (i) is fast, both in theory and practice, (ii) exhibits a worst-case constant-factor guarantee, and (iii) gives promising computational results showing that there can be significant benefits in addressing both issues together instead of sequentially.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers10
- Parameterized Approximation Algorithms for Sum of Radii Clustering and VariantsXianrun Chen, Dachuan Xu, Yicheng Xu, Yong ZhangAAAI 2024 · 17 citations
- Fairness in Streaming Submodular Maximization over a Matroid ConstraintMarwa El Halabi, Federico Fusco, Ashkan Norouzi-Fard, Jakab Tardos et al.ICML 2023 · 15 citations
- Doubly Constrained Fair ClusteringJohn P. Dickerson, Seyed A. Esmaeili, Jamie H. Morgenstern, Claire Jie ZhangNeurIPS 2023 · 14 citations
- Fair Clustering for Data Summarization: Improved Approximation Algorithms and Complexity InsightsAmeet Gadekar, Aristides Gionis, Suhas ThejaswiWWW 2025 · 7 citations
- On Socially Fair Low-Rank Approximation and Column Subset SelectionZhao Song, Ali Vakilian, David P. Woodruff, Samson ZhouNeurIPS 2024 · 6 citations
Builds on3
- Fairness in Streaming Submodular Maximization: Algorithms and HardnessMarwa El Halabi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakab Tardos et al.NeurIPS 2020 · 65 citations
- Fair k-Centers via Maximum MatchingMatthew Jones, Huy L. Nguyen, Thy Dinh NguyenICML 2020 · 63 citations
- Probabilistic Fair ClusteringSeyed A. Esmaeili, Brian Brubach, Leonidas Tsepenekas, John DickersonNeurIPS 2020 · 42 citations
Related papers
- Approximation Algorithms for Fair Range ClusteringSèdjro Salomon Hotegni, Sepideh Mahabadi, Ali VakilianICML 2023 · 25 citations
- How to Solve Fair k-Center in Massive Data ModelsAshish Chiplunkar, Sagar Sudhir Kale, Sivaramakrishnan Natarajan RamamoorthyICML 2020 · 45 citations
- Fair k-Center Clustering in MapReduce and Streaming SettingsSuman K. Bera, Syamantak Das, Sainyam Galhotra, Sagar Sudhir KaleWWW 2022 · 14 citations
- Fair k-Center Clustering on Massive Social Network Data StreamsLongkun Guo, Chaoqi Jia, Chao ChenWWW 2026
- Capacitated Fair-Range Clustering: Hardness and Approximation AlgorithmsAmeet Gadekar, Suhas Thejaswi MuniyappaICML 2026 · 4 citations
