Research map / Learning theory and algorithms / Clustering
Nearly-Tight and Oblivious Algorithms for Explainable 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
- Dynamic Algorithm for Explainable $k$-medians Clustering under $\ell_p$ Norm (NeurIPS 2025 · similarity 0.93)
- On the price of explainability for some clustering problems (ICML 2021 · similarity 0.93)
- SpEx: A Spectral Approach to Explainable Clustering (NeurIPS 2025 · similarity 0.90)
- Clustering with Non-adaptive Subset Queries (NeurIPS 2024 · similarity 0.86)
- Explaining Kernel Clustering via Decision Trees (ICLR 2024 · similarity 0.86)
- Beyond Worst-Case Coreset Bounds for $k$-Clustering via Determinantal Sampling (NeurIPS 2026 · similarity 0.85)
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.