Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Semi-supervised Boosting× | Gradient Boosting× | Propagarea etichetelor× | |
|---|---|---|---|
| Domeniu | Învățare automată | Învățare automată | Învățare automată |
| Familie | Machine learning | Machine learning | Machine learning |
| Anul apariției≠ | 1999–2009 | 2001 | 2002 |
| Autorul original≠ | Mallapragada, P. K.; Bennett, K. P.; and others | Friedman, J. H. | Zhu, X. & Ghahramani, Z. |
| Tip≠ | Semi-supervised ensemble method | Ensemble (sequential boosting of decision trees) | Graph-based semi-supervised classification |
| Sursa seminală≠ | Mallapragada, P. K., Jin, R., Jain, A. K., & Liu, Y. (2009). SemiBoost: Boosting for Semi-supervised Learning. IEEE Transactions on Pattern Analysis and Machine Intelligence, 31(11), 2000–2014. DOI ↗ | 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 ↗ |
| Denumiri alternative | SemiBoost, SSL boosting, boosting with unlabeled data, semi-supervised ensemble boosting | Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine | LP, label spreading, graph-based semi-supervised learning, harmonic label propagation |
| Înrudite≠ | 5 | 5 | 3 |
| Rezumat≠ | Semi-supervised Boosting is an ensemble learning paradigm that extends classical boosting algorithms — such as AdaBoost — to exploit both labeled and unlabeled data. By propagating label information through a similarity structure over unlabeled instances, it trains stronger classifiers than supervised boosting alone when labeled data are scarce. | 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. |
| ScholarGateSet de date ↗ |
|
|
|