方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 主动学习× | 随机森林× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2009 | 2001 |
| 提出者≠ | Burr Settles | Breiman, L. |
| 类型≠ | Interactive supervised learning framework | Ensemble (bagging of decision trees) |
| 开创性文献≠ | Settles, B. (2009). Active learning literature survey. University of Wisconsin-Madison Computer Sciences Technical Report 1648. link ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| 别名 | Query Learning, Optimal Experimental Design (ML context), Pool-Based Active Learning, Aktif Öğrenme | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| 相关≠ | 2 | 4 |
| 摘要≠ | 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. | Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree. |
| ScholarGate数据集 ↗ |
|
|