Machine learningMachine learning
在线K均值聚类 (Online K-means)
Online K-means 是经典 K-means 算法的流式变体，它一次更新一个聚类中心（或一小批数据），而无需将整个数据集存储在内存中。它特别适用于大规模、实时或连续到达的数据，因为批处理重新计算会过于缓慢或不切实际。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- 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 ↗
- Sculley, D. (2010). Web-scale k-means clustering. In Proceedings of the 19th International Conference on World Wide Web (WWW 2010), pp. 1177–1178. ACM. DOI: 10.1145/1772690.1772862 ↗
如何引用本页
ScholarGate. (2026, June 3). Online K-means Clustering (Sequential / Streaming K-means). ScholarGate. https://scholargate.app/zh/machine-learning/online-k-means
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
Compare side by side →