atlas

Research map / Learning theory and algorithms / Clustering

Consistent k-Clustering

ICML 2017 · Learning theory and algorithms › Clustering · approach: Coresets and dynamic clustering · 14 citations (OpenAlex)

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.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Adding the option to recluster (allowing β-consistent changes) instead of irrevocable online decisionsonline k-clustering · worst-case theoryconsistency (number of changes): Ω(k log n) changes needed vs. online irrevocable (β=0)Helped
Consistent k-clustering algorithm using Meyerson sketches with judicious reclusteringk-clustering under costp · worst-case theorynumber of reclusterings: O(k^2 log^4 n) vs naive recluster every stepHelped
Running a single Meyerson sketch instead of O(log n) parallel sketches (ablation)Consistent k-clustering implementation · SKINTYPE, SHUTTLE, COVERTYPEapproximation ratioHurt
Data order: non-random order of SKINTYPE vs randomly permutedConsistent k-clustering reclustering rate · SKINTYPEreclustering rateNo clear effect
Increasing k (10 to 100)Consistent k-clustering reclustering rate · SKINTYPE, SHUTTLE, COVERTYPEreclustering rateHurt

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy