Research map / Federated learning and privacy / Differential privacy
Differentially Private Clustering: Tight Approximation Ratios
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
- Differentially Private Clustering via Maximum Coverage (AAAI 2021 · similarity 0.95)
- Making Old Things New: A Unified Algorithm for Differentially Private Clustering (ICML 2024 · similarity 0.92)
- Online Differentially Private Consistent Clustering (NeurIPS 2026 · similarity 0.92)
- A Differentially Private Clustering Algorithm for Well-Clustered Graphs (ICLR 2024 · similarity 0.89)
- On the Price of Differential Privacy for Hierarchical Clustering (ICLR 2025 · similarity 0.88)
- Differentially Private Federated $k$-Means Clustering with Server-Side Data (ICML 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.