Extremely Randomized Trees - Archive ouverte HAL Access content directly
Journal Articles Machine Learning Year : 2006

Extremely Randomized Trees

(1) , (2) , (2)


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 default choice of this parameter, and we also provide insight on how to adjust it in particular situations. Besides accuracy, the main strength of the resulting algorithm is computational efficiency. A bias/variance analysis of the Extra-Trees algorithm is also provided as well as a geometrical and a kernel characterization of the models induced.

Dates and versions

hal-00341932 , version 1 (26-11-2008)



Pierre Geurts, Damien Ernst, Louis Wehenkel. Extremely Randomized Trees. Machine Learning, 2006, 36, pp.3--42. ⟨10.1007/s10994-006-6226-1⟩. ⟨hal-00341932⟩
2078 View
0 Download



Gmail Facebook Twitter LinkedIn More