方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 鲁棒主动学习× | 鲁棒随机森林× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2006 | 2000s–2010s |
| 提出者≠ | Balcan, M.-F.; Beygelzimer, A.; Langford, J. | Various (extensions of Breiman 2001 Random Forest) |
| 类型≠ | Active learning with robustness guarantees | Robust Ensemble (noise-tolerant bagging of decision trees) |
| 开创性文献≠ | Balcan, M.-F., Beygelzimer, A., & Langford, J. (2006). Agnostic active learning. In Proceedings of the 23rd International Conference on Machine Learning (ICML 2006), pp. 65–72. ACM. DOI ↗ | Chen, S., & Guestrin, C. (2019). Robust Random Forest. In Proceedings of the 36th International Conference on Machine Learning (ICML). Also see: Gao, W., & Zhou, Z.-H. (2013). On the Doubt about Margin Explanation of Boosting. Artificial Intelligence, 203, 1–18. link ↗ |
| 别名 | RAL, noise-tolerant active learning, robust query learning, adversarially robust active learning | RRF, noise-robust random forest, outlier-resistant random forest, robust ensemble forest |
| 相关 | 6 | 6 |
| 摘要≠ | Robust Active Learning extends the standard active learning framework to handle noisy labels, adversarial perturbations, and unreliable oracles. Rather than assuming perfect labeling, it incorporates statistical or adversarial robustness guarantees into the query selection process, maintaining sample efficiency while tolerating corruption in the annotation process. | Robust Random Forest extends the standard Random Forest ensemble by incorporating mechanisms that reduce the influence of outliers, label noise, and corrupted observations. Rather than treating all training instances equally, it applies weighting or filtering strategies so that noisy or anomalous samples contribute less to individual tree splits, yielding predictions that remain reliable even when data quality is imperfect. |
| ScholarGate数据集 ↗ |
|
|