方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 鲁棒k均值× | 谱聚类× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1999 | 2002 |
| 提出者≠ | Garcia-Escudero, L. A. & Gordaliza, A. | Ng, A. Y.; Jordan, M. I.; Weiss, Y. |
| 类型≠ | Robust clustering algorithm | Graph-based clustering (spectral method) |
| 开创性文献≠ | 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 ↗ | Ng, A. Y., Jordan, M. I., & Weiss, Y. (2002). On Spectral Clustering: Analysis and an Algorithm. Advances in Neural Information Processing Systems, 14, 849–856. link ↗ |
| 别名≠ | robust k-means clustering, trimmed k-means, outlier-resistant k-means, RKM | NJW spectral clustering, graph Laplacian clustering, normalized spectral clustering, spectral graph clustering |
| 相关≠ | 4 | 5 |
| 摘要≠ | 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. | Spectral Clustering is a graph-based unsupervised learning algorithm, formalized by Ng, Jordan, and Weiss in 2002, that maps data points into a low-dimensional eigenspace derived from the similarity graph's Laplacian before applying k-means. This spectral embedding makes it possible to recover clusters of arbitrary shape — rings, crescents, interleaved spirals — that Euclidean distance-based methods consistently fail to separate. |
| ScholarGate数据集 ↗ |
|
|