ScholarGate
Assistant

Comparer des méthodes

Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.

Forêt Aléatoire×Arbre de décision×Machine à vecteurs de support (Classification)×
DomaineApprentissage automatiqueApprentissage automatiqueApprentissage automatique
FamilleMachine learningMachine learningMachine learning
Année d'origine200119841995
Auteur d'origineBreiman, L.Breiman, Friedman, Olshen & StoneCortes, C. & Vapnik, V.
TypeEnsemble (bagging of decision trees)Recursive partitioning (if-then rules)Maximum-margin classifier (kernel method)
Source fondatriceBreiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗Cortes, C. & Vapnik, V. (1995). Support-Vector Networks. Machine Learning, 20, 273–297. DOI ↗
AliasRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensembleKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression treeDestek Vektör Makinesi (SVM — Sınıflandırma), support-vector network, SVM classifier, maximum-margin classifier
Apparentées455
Résumé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.A Decision Tree is an interpretable classification and regression method, formalised by Breiman, Friedman, Olshen and Stone in their 1984 CART framework, that partitions the data with hierarchical if-then rules. Each split sends observations down one branch or another until a prediction is read off the leaf.The Support Vector Machine, introduced by Corinna Cortes and Vladimir Vapnik in 1995, is a classifier that finds the optimal separating hyperplane between classes in a high-dimensional space. It chooses the boundary that leaves the widest possible margin to the nearest training points, which makes its decisions robust on new data.
ScholarGateJeu de données
  1. v1
  2. 2 Sources
  3. PUBLISHED
  1. v1
  2. 1 Sources
  3. PUBLISHED
  1. v1
  2. 1 Sources
  3. PUBLISHED

Aller à la recherche Télécharger les diapositives

ScholarGateComparer des méthodes: Random Forest · Decision Tree · Support Vector Machine. Consulté le 2026-06-18 sur https://scholargate.app/fr/compare