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.

Extra Trees×Arbre de décision×Forêt Aléatoire×
DomaineApprentissage automatiqueApprentissage automatiqueApprentissage automatique
FamilleMachine learningMachine learningMachine learning
Année d'origine200619842001
Auteur d'origineGeurts, P.; Ernst, D.; Wehenkel, L.Breiman, Friedman, Olshen & StoneBreiman, L.
TypeEnsemble (extremely randomized decision trees)Recursive partitioning (if-then rules)Ensemble (bagging of decision trees)
Source fondatriceGeurts, P., Ernst, D. & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42. DOI ↗Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
AliasExtremely Randomized Trees, ExtraTreesClassifier, ExtraTreesRegressor, ETKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression treeRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Apparentées554
RésuméExtra Trees (Extremely Randomized Trees), introduced by Geurts, Ernst, and Wehenkel in 2006, is an ensemble of decision trees that pushes randomisation further than Random Forest. Both the candidate features and the split thresholds are chosen completely at random at each node, eliminating the greedy search over thresholds. This extra randomness reduces variance, often matches or exceeds Random Forest accuracy, and runs substantially faster at training time.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.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.
ScholarGateJeu de données
  1. v1
  2. 2 Sources
  3. PUBLISHED
  1. v1
  2. 1 Sources
  3. PUBLISHED
  1. v1
  2. 2 Sources
  3. PUBLISHED

Aller à la recherche Télécharger les diapositives

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