方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 梯度提升（Gradient Boosting）× | 标签传播× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2001 | 2002 |
| 提出者≠ | Friedman, J. H. | Zhu, X. & Ghahramani, Z. |
| 类型≠ | Ensemble (sequential boosting of decision trees) | Graph-based semi-supervised classification |
| 开创性文献≠ | Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ | Zhu, X., & Ghahramani, Z. (2002). Learning from labeled and unlabeled data with label propagation. Technical Report CMU-CALD-02-107, Carnegie Mellon University. link ↗ |
| 别名 | Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine | LP, label spreading, graph-based semi-supervised learning, harmonic label propagation |
| 相关≠ | 5 | 3 |
| 摘要≠ | 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. | Label Propagation is a graph-based semi-supervised learning algorithm introduced by Zhu and Ghahramani in 2002 that spreads class labels from a small set of labeled nodes to a large set of unlabeled nodes by iteratively diffusing label information along the edges of a similarity graph, exploiting the manifold structure of the data. |
| ScholarGate数据集 ↗ |
|
|