Comparer des méthodes

	Bagging semi-supervisé	Forêt Aléatoire
Domaine	Apprentissage automatique	Apprentissage automatique
Famille	Machine learning	Machine learning
Année d'origine	2000s	2001
Auteur d'origine	Various (Breiman bagging + semi-supervised extensions, 1990s–2000s)	Breiman, L.
Type	Semi-supervised ensemble (bagging variant)	Ensemble (bagging of decision trees)
Source fondatrice	Bennett, K. P., & Demiriz, A. (1999). Semi-supervised support vector machines. Advances in Neural Information Processing Systems, 11. MIT Press.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
Alias	SS-Bagging, semi-supervised bootstrap aggregating, self-training bagging, bagging with pseudo-labels	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Apparentées	4	4
Résumé	Semi-supervised Bagging extends the classical bagging ensemble to settings where labeled training examples are scarce but large amounts of unlabeled data are available. Base learners trained on labeled data assign pseudo-labels to unlabeled examples; the expanded dataset is then used to grow a diverse ensemble whose aggregated vote is more accurate and more stable than any single model trained on the limited labeled set alone.	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.