atlas

Research map / Learning theory and algorithms / Clustering

Robust k-means: a Theoretical Revisit

NeurIPS 2016 · Learning theory and algorithms › Clustering · approach: k-means++ seeding analysis · 20 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
Use a biased proximal map (convex f_lambda, e.g. l1 penalty / Huber Moreau envelope) instead of unbiasedrobust k-means · theoretical breakdown analysisfinite-sample breakdown point: breakdown point 1/n (one outlier suffices)Hurt
Use an unbiased (non-convex, e.g. l0-type) proximal map satisfying P(x)=x for large |x|robust k-means · theoretical breakdown analysisuniversal breakdown point: breakdown point 2/n instead of 1/nHelped
Restrict to well-structured (rho1,rho2)-balanced datasets with well-separated inlier balls and suitable lambdarobust k-means · theoretical restricted robustness analysiseffect of outliers on grouping of inliersHelped
Empirical comparison of robust k-means vs trimmed k-means on mixture of 10 Gaussians with mild/heavy outliersrobust k-means · synthetic 10-Gaussian mixture with 150 outliersaccuracy, center error, outlier detection ratesNo clear effect
Well-clustered two-sphere dataset with heavy contamination (50% outliers)robust k-means · two spherical clusters, 150 outliers in [-6,6]^10clustering performanceHelped

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