Research map / Learning theory and algorithms / Clustering
Uniform Concentration Bounds toward a Unified Framework for Robust 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
- Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search (NeurIPS 2017 · similarity 0.90)
- Near-optimal Coresets for Robust Clustering (ICLR 2023 · similarity 0.90)
- Convex Clustering Redefined: Robust Learning with the Median of Means Estimator (AAAI 2026 · similarity 0.89)
- Efficient Constrained K-center Clustering with Background Knowledge (AAAI 2024 · similarity 0.88)
- Beyond Worst-Case Coreset Bounds for $k$-Clustering via Determinantal Sampling (NeurIPS 2026 · similarity 0.88)
- New Bounds on the Cohesion of Complete-link and Other Linkage Methods for Agglomerative Clustering (ICML 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.