Research map / Learning theory and algorithms / Clustering
Improved Streaming Algorithm for Fair k-Center Clustering
Longkun Guo, Zeyu Lin, Chaoqi Jia, Chao Chen
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use 5-Approx one-pass instead of 7-Approx one-pass | streaming fair k-center · Wholesale | cost: 1.28 -> 1.04 | Improved |
| use 5-Approx one-pass instead of 7-Approx one-pass | streaming fair k-center · CelebA | cost: 26.27 -> 21.34 | Improved |
| use 5-Approx one-pass instead of 7-Approx one-pass | streaming fair k-center · CreditCard | cost: 1.89 -> 1.03 | Improved |
| use semi-structured 3-Approx instead of one-pass 5-Approx | streaming fair k-center · Bank | cost: 0.61 -> 0.40 | Improved |
| use semi-structured 3-Approx instead of one-pass 5-Approx | streaming fair k-center · SushiA | cost: 1.41 -> 1.51 | Hurt |
| use semi-structured 3-Approx instead of two-pass 3-Approx | streaming fair k-center · Bank | cost: 0.43 -> 0.40 | Improved |
| use two-pass 3-Approx instead of semi-structured 3-Approx | streaming fair k-center · Wholesale | cost: 0.84 -> 0.61 | Improved |
| use 5-Approx instead of 7-Approx | streaming fair k-center · 100GB SimuB | runtime | Hurt |
| use ExJones (offline-derived) instead of 5-Approx | fair k-center · Student | cost: 1.90 -> 1.85 | Improved |
Closest papers by meaning
- Efficient Constrained K-center Clustering with Background Knowledge (AAAI 2024 · similarity 0.89)
- Fair Clustering in the Sliding Window Model (ICLR 2025 · similarity 0.89)
- Proportional Fairness in Non-Centroid Clustering (NeurIPS 2024 · similarity 0.88)
- Relax and Merge: A Simple Yet Effective Framework for Solving Fair $k$-Means and $k$-sparse Wasserstein Barycenter Problems (ICLR 2025 · similarity 0.88)
- Online Differentially Private Consistent Clustering (NeurIPS 2026 · similarity 0.88)
- Towards Fairer Centroids in K-means Clustering (AAAI 2024 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
