Extremely randomized trees

@article{Geurts2006ExtremelyRT,
  title={Extremely randomized trees},
  author={P. Geurts and D. Ernst and L. Wehenkel},
  journal={Machine Learning},
  year={2006},
  volume={63},
  pages={3-42}
}
  • P. Geurts, D. Ernst, L. Wehenkel
  • Published 2006
  • Mathematics, Computer Science
  • Machine Learning
  • This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute and cut-point choice while splitting a tree node. In the extreme case, it builds totally randomized trees whose structures are independent of the output values of the learning sample. The strength of the randomization can be tuned to problem specifics by the appropriate choice of a parameter. We evaluate the robustness of the… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Towards generating random forests via extremely randomized trees
    15
    Learning with Ensembles of Randomized Trees : New Insights
    5
    Influence of Hyperparameters on Random Forest Accuracy
    76
    Embedding Monte Carlo Search of Features in Tree-Based Ensemble Methods
    1
    AMF: Aggregated Mondrian Forests for Online Learning
    1
    An Empirical Comparison of Supervised Ensemble Learning Approaches
    9
    Kernelizing the output of tree-based methods
    57

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 73 REFERENCES
    The Random Subspace Method for Constructing Decision Forests
    • T. Ho
    • Computer Science
    • 1998
    4360
    An Empirical Comparison of Selection Measures for Decision-Tree Induction
    221
    Approximate Splitting for Ensembles of Trees using Histograms
    17
    An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees: Bagging, Boosting, and Randomization
    2331
    A further comparison of splitting rules for decision-tree induction
    77
    A Further Comparison of Splitting Rules for Decision-Tree Induction
    205
    SOME INFINITY THEORY FOR PREDICTOR ENSEMBLES
    148
    Random Forests
    46162
    PERT – Perfect Random Tree Ensembles
    87