方法对比
并排查看您选择的方法;存在差异的行会高亮显示。
| 主动学习投票集成× | 主动学习× | Boosting× | |
|---|---|---|---|
| 领域 | 机器学习 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning | Machine learning |
| 起源年份≠ | 1992 | 2009 | 1990–1997 |
| 提出者≠ | Seung, H. S., Opper, M., & Sompolinsky, H. | Burr Settles | Schapire, R. E.; Freund, Y. |
| 类型≠ | Active learning with ensemble voting | Interactive supervised learning framework | Sequential ensemble (iterative reweighting) |
| 开创性文献≠ | Seung, H. S., Opper, M., & Sompolinsky, H. (1992). Query by committee. In Proceedings of the Fifth Annual Workshop on Computational Learning Theory (COLT '92), pp. 287–294. ACM. DOI ↗ | Settles, B. (2009). Active learning literature survey. University of Wisconsin-Madison Computer Sciences Technical Report 1648. link ↗ | Freund, Y. & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119–139. DOI ↗ |
| 别名 | Query by Committee, QBC, active ensemble learning, committee-based active learning | Query Learning, Optimal Experimental Design (ML context), Pool-Based Active Learning, Aktif Öğrenme | AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble |
| 相关≠ | 5 | 2 | 6 |
| 摘要≠ | Active Learning Voting Ensemble — formally known as Query by Committee — is an active learning strategy that trains a committee of diverse models and selects the unlabeled examples where the committee members disagree most for human annotation. By focusing labeling effort on the most informative points, it achieves high accuracy with far fewer labeled examples than passive learning requires. | 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. | Boosting is a sequential ensemble technique that converts many simple, barely-better-than-chance learners into a single highly accurate model by repeatedly focusing training on the examples that previous learners got wrong, then combining all learners with weights proportional to their individual accuracy. |
| ScholarGate数据集 ↗ |
|
|
|