Extra Trees Classification System

An Extra Trees Classification System is an Extra Trees Learning System that implements an Extra Trees Classification Algorithm to solve a Extra Trees Classification Task.

• AKA: Extremely Randomized Trees Classification System, Ensemble Extra Trees Classifier.
• Context:
  • It is an Extra Trees Learning System for solving a Classification problem.
  • …
• Example(s):
  • sklearn.ensemble.ExtraTreesClassifier
• Counter-Example(s):
  • Extra Trees Regression System.
• See: Random Forests Model, Out-of-Bag Error, Partial Permutation, K-Nearest Neighbor Algorithm.

---

---

References

2017

• (Wikipedia, 2017) ⇒ https://en.wikipedia.org/wiki/Random_forest#ExtraTrees Retrieved:2017-11-5.
  • Adding one further step of randomization yields extremely randomized trees, or ExtraTrees. These are trained using bagging and the random subspace method, like in an ordinary random forest, but additionally the top-down splitting in the tree learner is randomized. Instead of computing the locally optimal feature/split combination (based on, e.g., information gain or the Gini impurity), for each feature under consideration, a random value is selected for the split. This value is selected from the feature's empirical range (in the tree's training set, i.e., the bootstrap sample).

---