atlas

Research map / Learning theory and algorithms / Clustering

Distributed $k$-Clustering for Data with Heavy Noise

NeurIPS 2018 · Learning theory and algorithms › Clustering · approach: Coresets and dynamic clustering · 13 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 local aggregation before sending data to the coordinatorDistributed (k, z)-center · (k, z)-center, general metricscommunication cost: O( km/ε + m log Δ/ε )Helped
Allow up to (1+ε)z outliers rather than 2zDistributed (k, z)-center · (k, z)-center, general metricsoutlier factor: 2+ε -> 1+εHelped
Use coresets for discretized truncated-distance instancesDistributed (k, z)-median/means · (k, z)-median and (k, z)-means, Euclidean metricsbicriteria approximation: (1+ε, 1+ε)Helped
Increase ε to 0.99 instead of using ε=0.1 (ablation)Distributed (k, z)-center algorithm · Small-dataset experiments, varying kcommunication costHelped
Increase ε to 0.99 instead of using ε=0.1 (ablation)Distributed (k, z)-center algorithm · Small-dataset experiments, varying kobjective valueHurt

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