Research map / Learning theory and algorithms / Clustering
Coreset for Line-Sets Clustering
Sagi Lotan, Ernesto Evgeniy Sanches Shayda, Dan Feldman
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 the sensitivity-based coreset instead of uniform sampling of the same size | Line-sets and colored-sets coreset · Synthetic, Reuters-21578 and California housing datasets | maximum approximation error | Improved |
| use coreset instead of uniform sampling when data is uniformly distributed | Line-sets coreset · Uniformly distributed data | maximum approximation error | No clear effect |
| increase k and m (number of centers and colors) | Uniform sampling baseline vs coreset · Colored-sets and line-sets datasets | maximum approximation error | Mixed |
Closest papers by meaning
- On Coresets for Clustering in Small Dimensional Euclidean spaces (ICML 2023 · similarity 0.90)
- Universal Weak Coreset (AAAI 2024 · similarity 0.87)
- Optimal Coresets for Low-Dimensional Geometric Median (ICML 2024 · similarity 0.87)
- Coreset for Robust Geometric Median: Eliminating Size Dependency on Outliers (NeurIPS 2025 · similarity 0.86)
- Faster Approximation Algorithms for k-Center via Data Reduction (ICML 2025 · similarity 0.85)
- Beyond Worst-Case Coreset Bounds for $k$-Clustering via Determinantal Sampling (NeurIPS 2026 · similarity 0.83)
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.
