Latent structureMultivariate analysis

Robust K-means Clustering

Robust K-means clustering is an extension of classical k-means that protects cluster estimates from distortion caused by outliers or contaminated observations. By trimming a user-specified fraction of the most extreme points before updating cluster centers, the algorithm yields stable, meaningful partitions even when the data contain atypical cases that would severely bias standard k-means.

Apply with StatMindSoonVideoSoon

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. Cuesta-Albertos, J. A., Gordaliza, A., & Matrán, C. (1997). Trimmed k-means: An attempt to robustify quantizers. The Annals of Statistics, 25(2), 553–576. DOI: 10.1214/aos/1031833664
  2. García-Escudero, L. A., Gordaliza, A., Matrán, C., & Mayo-Iscar, A. (2008). A general trimming approach to robust cluster analysis. The Annals of Statistics, 36(3), 1324–1345. DOI: 10.1214/07-AOS515

Related methods

Referenced by

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