Extremely randomized trees

@article{Geurts2006ExtremelyRT,
  title={Extremely randomized trees},
  author={Pierre Geurts and Damien Ernst and Louis Wehenkel},
  journal={Machine Learning},
  year={2006},
  volume={63},
  pages={3-42}
}
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
BETA

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 1,082 CITATIONS, ESTIMATED 44% COVERAGE

2,467 Citations

0200400'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 2,467 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-10 OF 11 REFERENCES

Setting up, using, and understanding random forests V4.0

  • L. Breiman
  • University of California, Department of Statisti…
  • 2003
1 Excerpt

The elements of statisti al learning: data mining, inferen e and predi tion

  • T. Hastie, R. Tibshirani, J. Friedman
  • Springer,
  • 2001

An introdu tion to support ve tor ma hines

  • C. Cristianini, J. Shawe-Taylor
  • MIT Press, Cambridge, MA,
  • 2000

h

  • T. G. Dietter
  • An experimental omparison of three methods for…
  • 2000

Automati learning te hniques in power systems

  • L. Wehenkel
  • Kluwer A ademi , Boston,
  • 1998

The random subspa e method for onstru ting de ision forests

  • T. K. Ho
  • IEEE Transa tions on Pattern Analysis and Ma…
  • 1998

h and E

  • T. G. Dietter
  • B. Kong. Ma hine learning bias, statisti al bias…
  • 1995

Similar Papers

Loading similar papers…