Example: stock market
Classification and regression trees

Classification and regression trees

Back to document page

Algorithm 1 Pseudocode for tree construction by exhaustive search 1. Start at the root node. 2. For each X, find the set S that minimizes the sum of the node impurities in the two child nodes and choose the split {X∗ ∈ S∗} that gives the minimum overall X and S. 3. If a stopping criterion is reached, exit. Oth-erwise, apply step 2 to ...

  Construction, Classification

Download Classification and regression trees


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries