AI engineering glossary · Classical ML algorithms
What is extremely randomised trees?
Extremely randomised trees (also called Extra Trees): A forest variant that goes one step beyond random subsets: at each split it draws random thresholds for candidate features and keeps the best of those, instead of searching for the optimal cut. It usually trains faster and adds extra smoothing.
Extremely randomised trees: an example
ExtraTreesClassifier in scikit-learn trains 500 such trees on the same data as a random forest, often in less time.
Related terms
More Classical ML algorithms terms
- Feature importance
- Gaussian mixture model
- Gaussian naive Bayes
- Gaussian process
- Gini impurity
- Gradient boosting
- HDBSCAN
- Hierarchical clustering
Where you learn it
Extremely randomised trees is part of the AI Engineering Program, which teaches it with notes, a hands-on lab and an exam. The first lesson is free.