| ... | @@ -83,13 +83,9 @@ v.Return the Tree |
... | @@ -83,13 +83,9 @@ v.Return the Tree |
|
|
The recursive algorithm is stopped when either of the followings is true:
|
|
The recursive algorithm is stopped when either of the followings is true:
|
|
|
|
|
|
|
|
* All examples in the training set belong to a single class / value y,
|
|
* All examples in the training set belong to a single class / value y,
|
|
|
|
|
|
|
|
* The maximum tree depth is reached,
|
|
* The maximum tree depth is reached,
|
|
|
|
|
|
|
|
* If the node is further split, the number of cases in one or more child nodes will be less than the minimum number instances in a node,
|
|
* If the node is further split, the number of cases in one or more child nodes will be less than the minimum number instances in a node,
|
|
|
|
|
|
|
|
* The number of examples left in the node is less than the minimum number set for parent nodes,
|
|
* The number of examples left in the node is less than the minimum number set for parent nodes,
|
|
|
|
|
|
|
|
* Splitting leads to a split score less than a threshold value.
|
|
* Splitting leads to a split score less than a threshold value.
|
|
|
|
|
|
|
|
### CART
|
|
### CART
|
| ... | |
... | |
| ... | | ... | |