Extremely randomized trees have been introduced by Pierre Geurts, Damien Ernst and Louis Wehenkel in the article “Extremely randomized trees”, 2006 [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.65.7485&rep=rep1&type=pdf]. The algorithm of growing Extremely randomized trees is similar to Random Trees (Random Forest), but there are two differences:
CvERTrees
: public CvRTrees
¶The class implements the Extremely randomized trees algorithm. CvERTrees
is inherited from CvRTrees
and has the same interface, so see description of CvRTrees
class to get details. To set the training parameters of Extremely randomized trees the same class CvRTParams
is used.