方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 主动学习 LightGBM× | 梯度提升（Gradient Boosting）× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2017–present | 2001 |
| 提出者≠ | Settles, B. (active learning); Ke, G. et al. (LightGBM) | Friedman, J. H. |
| 类型≠ | Hybrid (active learning query strategy + gradient boosting classifier) | Ensemble (sequential boosting of decision trees) |
| 开创性文献≠ | Settles, B. (2012). Active Learning. Synthesis Lectures on Artificial Intelligence and Machine Learning, 6(1), 1–114. Morgan & Claypool. DOI ↗ | Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ |
| 别名 | AL-LightGBM, Active LightGBM, LightGBM active learning, AL-LGBM | Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine |
| 相关 | 5 | 5 |
| 摘要≠ | Active Learning LightGBM couples the query-efficient label-selection strategy of active learning with the speed and accuracy of LightGBM, a histogram-based gradient boosting framework. The model iteratively selects the most informative unlabeled instances for human annotation, retrains LightGBM on the growing labeled set, and converges to high accuracy with far fewer labeled examples than passive supervised learning. | Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost. |
| ScholarGate数据集 ↗ |
|
|