方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 半监督K-均值× | 主动学习× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2001–2002 | 2009 |
| 提出者≠ | Wagstaff, K. et al. (constrained); Basu, S. et al. (seeded) | Burr Settles |
| 类型≠ | Semi-supervised clustering | Interactive supervised learning framework |
| 开创性文献≠ | Wagstaff, K., Cardie, C., Rogers, S., & Schroedl, S. (2001). Constrained K-means Clustering with Background Knowledge. In Proceedings of the 18th International Conference on Machine Learning (ICML 2001), pp. 577–584. link ↗ | Settles, B. (2009). Active learning literature survey. University of Wisconsin-Madison Computer Sciences Technical Report 1648. link ↗ |
| 别名 | constrained K-means, seeded K-means, partially supervised K-means, SS-K-means | Query Learning, Optimal Experimental Design (ML context), Pool-Based Active Learning, Aktif Öğrenme |
| 相关≠ | 5 | 2 |
| 摘要≠ | Semi-supervised K-means extends standard K-means clustering by incorporating partial supervision — either a small set of labeled seed points or pairwise must-link and cannot-link constraints — to guide cluster formation. It bridges unsupervised clustering and fully supervised classification, enabling more meaningful clusters when labels are scarce but costly to obtain in full. | Active learning is an iterative machine-learning paradigm in which a learning algorithm selectively queries an oracle — typically a human annotator — for labels on the most informative unlabeled examples. Formalized by Burr Settles in his seminal 2009 literature survey, active learning addresses the practical bottleneck of annotation cost by achieving high model accuracy with far fewer labeled examples than passive supervised learning requires. |
| ScholarGate数据集 ↗ |
|
|