From c2ae452ab9cc7c351c6276b5e13fe0fe8bb200c1 Mon Sep 17 00:00:00 2001 From: Maria Dimashova Date: Wed, 18 Apr 2012 11:44:35 +0000 Subject: [PATCH] fixed misspelling in ertrees doc --- modules/ml/doc/ertrees.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/modules/ml/doc/ertrees.rst b/modules/ml/doc/ertrees.rst index 9e289e6..7d0654b 100644 --- a/modules/ml/doc/ertrees.rst +++ b/modules/ml/doc/ertrees.rst @@ -3,7 +3,7 @@ Extremely randomized trees 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 :ref:`Random Trees` (Random Forest), but there are two differences: -#. Extremely randomized trees don't apply the bagging procedure to constract the training samples for each tree. The same input training set is used to train all trees. +#. Extremely randomized trees don't apply the bagging procedure to construct a set of the training samples for each tree. The same input training set is used to train all trees. #. Extremely randomized trees pick a node split very extremely (both a variable index and variable splitting value are chosen randomly), whereas Random Forest finds the best split (optimal one by variable index and variable splitting value) among random subset of variables. -- 2.7.4