Extremely randomized trees

Explore this paper's citation graph

Summary

A new tree-based ensemble method for supervised classification and regression problems that consists of randomizing strongly both attribute and cut-point choice while splitting a tree node and builds totally randomized trees whose structures are independent of the output values of the learning sample.

Type
article
Published
2006-04-01
Cited by
8,655
References
51
Access
Open access

Keywords

Robustness (evolution), Mathematics, Artificial intelligence, Computer science, Algorithm

References

Cited by

Related papers