Comparer des méthodes

	Machine à vecteurs de support semi-supervisée	Forêt Aléatoire
Domaine	Apprentissage automatique	Apprentissage automatique
Famille	Machine learning	Machine learning
Année d'origine	1999	2001
Auteur d'origine	Joachims, T.	Breiman, L.
Type	Semi-supervised classifier	Ensemble (bagging of decision trees)
Source fondatrice	Joachims, T. (1999). Transductive Inference for Text Classification using Support Vector Machines. Proceedings of the 16th International Conference on Machine Learning (ICML), 200–209.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
Alias	S3VM, Transductive SVM, TSVM, Semi-SVM	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Apparentées	4	4
Résumé	Semi-supervised Support Vector Machine (S3VM) extends the classical SVM by incorporating large quantities of unlabeled data alongside a small labeled training set. It seeks a maximum-margin hyperplane that not only separates the labeled examples but also passes through low-density regions of the full data distribution, yielding better generalization when labeled samples are scarce.	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.