方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 在线K均值聚类 (Online K-means)× | 层次聚类× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1967 (online update rule); 2010 (mini-batch variant) | 1963 |
| 提出者≠ | MacQueen, J. (batch); Sculley, D. (mini-batch web-scale variant) | Ward, J. H. |
| 类型≠ | Unsupervised clustering (online/streaming) | Unsupervised clustering (agglomerative) |
| 开创性文献≠ | MacQueen, J. (1967). Some methods for classification and analysis of multivariate observations. In Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Vol. 1, pp. 281–297. University of California Press. link ↗ | Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244. DOI ↗ |
| 别名≠ | sequential k-means, streaming k-means, incremental k-means, online clustering | Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering |
| 相关 | 4 | 4 |
| 摘要≠ | Online K-means is a streaming variant of the classical K-means algorithm that updates cluster centroids one observation at a time — or in small mini-batches — without storing the entire dataset in memory. It is particularly suited to large-scale, real-time, or continuously arriving data where batch recomputation would be too slow or impractical. | Hierarchical clustering is an unsupervised method that groups observations into nested clusters and draws the result as a dendrogram, so the number of clusters need not be fixed in advance. Its agglomerative form rests on the objective-function grouping criterion introduced by Joe Ward in 1963. |
| ScholarGate数据集 ↗ |
|
|