Comparer des méthodes

	XGBoost semi-supervisé	Gradient Boosting	Propagation d'étiquettes	Forêt Aléatoire
Domaine	Apprentissage automatique	Apprentissage automatique	Apprentissage automatique	Apprentissage automatique
Famille	Machine learning	Machine learning	Machine learning	Machine learning
Année d'origine	2016–2018	2001	2002	2001
Auteur d'origine	Chen, T. & Guestrin, C. (XGBoost); semi-supervised extension by multiple authors	Friedman, J. H.	Zhu, X. & Ghahramani, Z.	Breiman, L.
Type	Ensemble (semi-supervised gradient boosting)	Ensemble (sequential boosting of decision trees)	Graph-based semi-supervised classification	Ensemble (bagging of decision trees)
Source fondatrice	Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 785–794.	Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232.	Zhu, X., & Ghahramani, Z. (2002). Learning from labeled and unlabeled data with label propagation. Technical Report CMU-CALD-02-107, Carnegie Mellon University.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
Alias	SS-XGBoost, semi-supervised gradient boosting, pseudo-label XGBoost, label-propagation XGBoost	Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine	LP, label spreading, graph-based semi-supervised learning, harmonic label propagation	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Apparentées	4	5	3	4
Résumé	Semi-supervised XGBoost extends the XGBoost gradient boosting framework to settings where only a fraction of training examples carry labels. By iteratively generating pseudo-labels for unlabeled data and retraining on the expanded set, the method extracts signal from unlabeled observations, improving generalization 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.	Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.