方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 鲁棒层次聚类× | 鲁棒 K-均值聚类× | |
|---|---|---|
| 领域 | 统计学 | 统计学 |
| 方法族 | Latent structure | Latent structure |
| 起源年份≠ | 1990 | 1997 |
| 提出者≠ | Kaufman & Rousseeuw (building on Ward, 1963 and others) | Cuesta-Albertos, Gordaliza & Matrán |
| 类型≠ | Robust unsupervised clustering | Robust partitional clustering |
| 开创性文献≠ | Kaufman, L. & Rousseeuw, P. J. (1990). Finding Groups in Data: An Introduction to Cluster Analysis. Wiley. ISBN: 978-0471878766 | 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 ↗ |
| 别名 | robust agglomerative clustering, outlier-resistant hierarchical clustering, robust linkage clustering, RHC | trimmed k-means, TCLUST k-means, contamination-resistant k-means, outlier-robust clustering |
| 相关≠ | 5 | 4 |
| 摘要≠ | Robust hierarchical clustering extends classical agglomerative or divisive hierarchical clustering by replacing sensitive distance measures and linkage criteria with outlier-resistant alternatives, preserving cluster structure even when data contain anomalous observations or heavy-tailed distributions. | 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. |
| ScholarGate数据集 ↗ |
|
|