#include <cart.hh>
Inheritance diagram for Algo::CART:
Public Member Functions | |
| CART (std::vector< Data::Column * > &cols, std::vector< unsigned int > &learning, std::string &classification_col) | |
| void | construct_tree () |
| public method to construct the tree | |
Protected Member Functions | |
| void | _construct_tree (Tree::DecisionTree &tree) |
| private methode to start construction | |
| void | _cut_tree (Tree::DecisionTree &tree) |
| elague tree | |
| float | _compute_g (Tree::DecisionTree &tree) |
| evaluate the cart error on a decision tree node | |
| Tree::DecisionTree * | _get_next_tree (Tree::DecisionTree *tree) |
| compute the next tree (delete a node and his sub node) this function is used during cut | |
|
std::pair< Tree::DecisionTree *, float > | _get_best_node (Tree::DecisionTree *) |
| recursive funtion that compute the cart error (_compute_g) on each node, and return the node with the smaller value | |
Definition at line 33 of file cart.hh.
1.3.2