方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 半监督随机森林× | 梯度提升（Gradient Boosting）× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2009 | 2001 |
| 提出者≠ | Leistner, C., Saffari, A., Santner, J., & Bischof, H. | Friedman, J. H. |
| 类型≠ | Semi-supervised ensemble classifier | Ensemble (sequential boosting of decision trees) |
| 开创性文献≠ | Leistner, C., Saffari, A., Santner, J., & Bischof, H. (2009). Semi-supervised random forests. In Proceedings of the IEEE 12th International Conference on Computer Vision (ICCV), pp. 506–513. IEEE. DOI ↗ | Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ |
| 别名 | SSL-RF, semi-supervised forest, label-propagation random forest, self-training random forest | Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine |
| 相关≠ | 3 | 5 |
| 摘要≠ | Semi-supervised Random Forest (SSL-RF) extends the classic Random Forest by exploiting both labeled and unlabeled training examples. When labeling data is expensive or time-consuming, SSL-RF assigns tentative pseudo-labels to unlabeled observations through the forest itself, then retrains on the enriched dataset, progressively improving accuracy without requiring additional human annotation. | 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数据集 ↗ |
|
|