方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 集成K均值× | K-means聚类× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2002 | 1967 (formalized 1982) |
| 提出者≠ | Strehl, A. & Ghosh, J. | MacQueen, J. B.; Lloyd, S. P. |
| 类型≠ | Ensemble clustering (consensus aggregation of K-means partitions) | Partitional clustering |
| 开创性文献≠ | Strehl, A. & Ghosh, J. (2002). Cluster ensembles — a knowledge reuse framework for combining multiple partitions. Journal of Machine Learning Research, 3, 583–617. link ↗ | Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. DOI ↗ |
| 别名 | consensus K-means, K-means ensemble clustering, cluster ensemble with K-means, EKM | k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means |
| 相关≠ | 3 | 4 |
| 摘要≠ | Ensemble K-means runs K-means clustering many times under varied initializations, random seeds, or feature subsets, then aggregates the resulting partitions into a single consensus assignment. This approach reduces K-means' well-known sensitivity to initialization and produces more stable, reproducible clusters than any single run. | 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. |
| ScholarGate数据集 ↗ |
|
|