Machine learningMachine learning

Extra Trees

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.

Open in MethodMindSoonVideoSoon

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. Geurts, P., Ernst, D. & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42. DOI: 10.1007/s10994-006-6226-1
  2. Extra-Trees. Wikipedia. link

Related methods

Referenced by

ScholarGateExtra Trees (Extremely Randomized Trees (Extra-Trees)). Retrieved 2026-06-04 from https://scholargate.app/en/machine-learning/extra-trees