ScholarGate
Assistent

Methoden vergelijken

Bekijk de geselecteerde methoden naast elkaar; rijen die verschillen zijn gemarkeerd.

Beslisboom×Extra Trees×Random Forest×
VakgebiedMachine learningMachine learningMachine learning
FamilieMachine learningMachine learningMachine learning
Jaar van ontstaan198420062001
GrondleggerBreiman, Friedman, Olshen & StoneGeurts, P.; Ernst, D.; Wehenkel, L.Breiman, L.
TypeRecursive partitioning (if-then rules)Ensemble (extremely randomized decision trees)Ensemble (bagging of decision trees)
Oorspronkelijke bronBreiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗Geurts, P., Ernst, D. & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42. DOI ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
AliassenKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression treeExtremely Randomized Trees, ExtraTreesClassifier, ExtraTreesRegressor, ETRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Verwant554
SamenvattingA 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.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.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.
ScholarGateGegevensset
  1. v1
  2. 1 Bronnen
  3. PUBLISHED
  1. v1
  2. 2 Bronnen
  3. PUBLISHED
  1. v1
  2. 2 Bronnen
  3. PUBLISHED

Naar zoeken Dia's downloaden

ScholarGateMethoden vergelijken: Decision Tree · Extra Trees · Random Forest. Geraadpleegd op 2026-06-17 via https://scholargate.app/nl/compare