方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| K-means聚类× | 谱聚类× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1967 (formalized 1982) | 2002 |
| 提出者≠ | MacQueen, J. B.; Lloyd, S. P. | Ng, A. Y.; Jordan, M. I.; Weiss, Y. |
| 类型≠ | Partitional clustering | Graph-based clustering (spectral method) |
| 开创性文献≠ | Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. 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 ↗ |
| 别名≠ | k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means | NJW spectral clustering, graph Laplacian clustering, normalized spectral clustering, spectral graph clustering |
| 相关≠ | 4 | 5 |
| 摘要≠ | K-means is a classic unsupervised partitional clustering algorithm that divides a dataset into K non-overlapping groups by iteratively assigning each observation to its nearest centroid and updating centroids as the mean of their assigned points. It is one of the most widely used exploratory tools in machine learning and data analysis. | 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数据集 ↗ |
|
|