方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 自监督增强学习× | 主动学习提升（Active Learning Boosting）× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2010s–2020s | 1998 |
| 提出者≠ | Various researchers (2010s–2020s) | Abe, N. & Mamitsuka, H. |
| 类型≠ | Ensemble (self-supervised + boosting) | Hybrid active-learning ensemble |
| 开创性文献≠ | Yarowsky, D. (1995). Unsupervised word sense disambiguation rivaling supervised methods. In Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics (pp. 189–196). ACL. link ↗ | Abe, N. & Mamitsuka, H. (1998). Query Learning Strategies Using Boosting and Bagging. Proceedings of the 15th International Conference on Machine Learning (ICML 1998), pp. 1–9. Morgan Kaufmann. link ↗ |
| 别名 | SSL boosting, self-supervised ensemble boosting, pretext-task boosting, SSL-Boost | boosting-based active learning, query learning with boosting, active boosting, ensemble active learning |
| 相关≠ | 6 | 4 |
| 摘要≠ | Self-supervised boosting integrates self-supervised pretext tasks into the boosting framework — covering AdaBoost, gradient boosting, and their modern variants — to leverage large pools of unlabeled data. By first learning feature representations from unlabeled samples and then running sequential weak-learner ensembles on pseudo-labeled data, it achieves competitive accuracy even when ground-truth labels are scarce. | Active Learning Boosting combines the query-driven label acquisition of active learning with the weighted-ensemble logic of boosting algorithms such as AdaBoost. The model iteratively selects the most informative unlabeled examples to annotate — guided by the disagreement or uncertainty within the boosting ensemble — and retrains after each new label, achieving high accuracy with far fewer labeled examples than passive learning. |
| ScholarGate数据集 ↗ |
|
|