方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 鲁棒 K-均值聚类× | 混合模型× | |
|---|---|---|
| 领域 | 统计学 | 统计学 |
| 方法族 | Latent structure | Latent structure |
| 起源年份≠ | 1997 | 1894 |
| 提出者≠ | Cuesta-Albertos, Gordaliza & Matrán | Karl Pearson |
| 类型≠ | Robust partitional clustering | Latent variable / density estimation |
| 开创性文献≠ | 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 ↗ | McLachlan, G. J. & Peel, D. (2000). Finite Mixture Models. Wiley-Interscience. ISBN: 978-0471006268 |
| 别名 | trimmed k-means, TCLUST k-means, contamination-resistant k-means, outlier-robust clustering | finite mixture model, mixture distribution model, FMM, model-based clustering |
| 相关≠ | 4 | 6 |
| 摘要≠ | 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. | Mixture modeling assumes that a population is composed of K unobserved subpopulations, each described by its own probability distribution. The observed data are treated as draws from a weighted combination of these component distributions. It provides a principled, model-based alternative to ad hoc clustering and supports formal comparison of solutions with different numbers of components. |
| ScholarGate数据集 ↗ |
|
|