Skip to main content

> ML_LITERATURE // GEURTS-2006-EXTREMELY-RANDOMIZED-TREES_v1.0

Extremely Randomized Trees (Extra-Trees)

Pierre Geurts, Damien Ernst, Louis Wehenkel · Machine Learning (2006)

algorithm2006industry-standardthirdPartyReproduced

Principal Contribution

Extreme randomization of both attribute choices and numerical cut-points, yielding faster training and higher variance reduction than Random Forests.

Operational Relevance

Serves as canonical technical reference for implementing task-binary-classification, task-multiclass-classification, task-regression in production systems.

Assumptions

  • Underlying data distribution satisfies empirical consistency and regularity assumptions across training domains

Limitations

  • Scaling characteristics and accuracy depend on hardware architecture, parameter scale, and dataset quality

Connected Algorithms, Architectures & Tools

Related Algorithms:
Related Architectures:
Implementing Libraries: