Research map / Learning theory and algorithms / Clustering
Near-Optimal Private and Scalable $k$-Clustering
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Locally Private k-Means Clustering with Constant Multiplicative Approximation and Near-Optimal Additive Error (AAAI 2022 · similarity 0.92)
- Online Differentially Private Consistent Clustering (NeurIPS 2026 · similarity 0.91)
- Relax and Merge: A Simple Yet Effective Framework for Solving Fair $k$-Means and $k$-sparse Wasserstein Barycenter Problems (ICLR 2025 · similarity 0.89)
- Faster Approximation Algorithms for k-Center via Data Reduction (ICML 2025 · similarity 0.89)
- A Differentially Private Clustering Algorithm for Well-Clustered Graphs (ICLR 2024 · similarity 0.89)
- Improved Fixed-Parameter Bounds for Min-Sum-Radii and Diameters k-Clustering and Their Fair Variants (AAAI 2025 · similarity 0.88)
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.