Machine learningMachine learning
K-means聚类
K-means是一种经典的无监督划分聚类算法，它通过迭代地将每个观测值分配给其最近的质心，并以分配点的均值更新质心，将数据集划分为K个互不重叠的组。它是机器学习和数据分析中最广泛使用的探索性工具之一。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
+17 more
来源
- Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. DOI: 10.1109/TIT.1982.1056489 ↗
- MacQueen, J. B. (1967). Some methods for classification and analysis of multivariate observations. Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, 1, 281–297. link ↗
如何引用本页
ScholarGate. (2026, June 3). K-means Clustering Algorithm. ScholarGate. https://scholargate.app/zh/machine-learning/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 →