Machine learningMachine learning

Robust k-means

Robust k-means is a variant of classical k-means clustering designed to resist the influence of outliers. By trimming a specified fraction of the most extreme observations before computing cluster centers, it produces stable and meaningful partitions even when the data contain noise, contamination, or heavy-tailed distributions — situations where standard k-means breaks down.

Open in MethodMindSoonVideoSoon

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. Garcia-Escudero, L. A., & Gordaliza, A. (1999). Robustness properties of k-means and trimmed k-means. Journal of the American Statistical Association, 94(447), 956–969. DOI: 10.1080/01621459.1999.10474195
  2. Garcia-Escudero, L. A., Gordaliza, A., Matrán, C., & Mayo-Iscar, A. (2008). A general trimming approach to robust cluster analysis. Annals of Statistics, 36(3), 1324–1345. DOI: 10.1214/07-AOS515

Related methods

Referenced by

ScholarGateRobust k-means (Robust k-means Clustering). Retrieved 2026-06-04 from https://scholargate.app/en/machine-learning/robust-k-means