方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 自监督 K-均值× | 集成K均值× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2018 | 2002 |
| 提出者≠ | Caron, M. et al. (DeepCluster framework) | Strehl, A. & Ghosh, J. |
| 类型≠ | Self-supervised clustering | Ensemble clustering (consensus aggregation of K-means partitions) |
| 开创性文献≠ | Caron, M., Bojanowski, P., Joulin, A., & Douze, M. (2018). Deep Clustering for Unsupervised Learning of Visual Features. In Proceedings of the European Conference on Computer Vision (ECCV), 132–149. link ↗ | Strehl, A. & Ghosh, J. (2002). Cluster ensembles — a knowledge reuse framework for combining multiple partitions. Journal of Machine Learning Research, 3, 583–617. link ↗ |
| 别名 | self-supervised clustering with K-means, deep clustering with K-means, unsupervised K-means with pseudo-labels, SSL K-means | consensus K-means, K-means ensemble clustering, cluster ensemble with K-means, EKM |
| 相关≠ | 5 | 3 |
| 摘要≠ | Self-supervised K-means is a clustering technique that combines K-means assignment with self-supervised representation learning. The model alternates between clustering unlabeled data points into K groups and using those cluster assignments as pseudo-labels to refine an underlying feature representation, yielding increasingly coherent clusters without any human-annotated ground truth. | 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. |
| ScholarGate数据集 ↗ |
|
|