مقایسهٔ روش‌ها

	خوشه‌بندی K-means مقاوم (Robust K-means Clustering)	مدل‌سازی آمیخته استوار
حوزه	آمار	آمار
خانواده	Latent structure	Latent structure
سال پیدایش	1997	2000–2008
پدیدآور	Cuesta-Albertos, Gordaliza & Matrán	Peel & McLachlan (t-mixture); Garcia-Escudero et al. (trimming framework)
نوع	Robust partitional clustering	Latent-class probabilistic clustering with outlier protection
منبع بنیادین	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.	Garcia-Escudero, L. A., Gordaliza, A., Matran, C. & Mayo-Iscar, A. (2008). A general trimming approach to robust cluster analysis. Annals of Statistics, 36(3), 1324–1345.
نام‌های دیگر	trimmed k-means, TCLUST k-means, contamination-resistant k-means, outlier-robust clustering	robust mixture model, robust GMM, outlier-robust mixture model, trimmed mixture model
مرتبط	4	5
خلاصه	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.	Robust mixture modeling fits finite mixture models — probabilistic clustering methods that assume data arise from a blend of underlying subpopulations — using component distributions or estimation strategies designed to be insensitive to outliers and heavy-tailed noise. The two dominant approaches replace Gaussian components with heavier-tailed distributions such as the multivariate t, or trim a fixed proportion of the most extreme observations before fitting.