Class dt_node stores the info in one node of the decision tree. More...
#include <weakrule.h>
Collaboration diagram for freeling::dt_node:
Public Member Functions | |
| dt_node () | |
| dt_node (int f) | |
| create non-leaf node, with given feature. | |
| dt_node (int nl, double pr[]) | |
| create leaf node, with given predictions. | |
| dt_node (const dt_node &n) | |
| copy constructor | |
Public Attributes | |
| int | feature |
| std::vector< double > | predictions |
Friends | |
| class | mlDTree |
Detailed Description
Class dt_node stores the info in one node of the decision tree.
Constructor & Destructor Documentation
create non-leaf node, with given feature.
| freeling::dt_node::dt_node | ( | int | nl, |
| double | pr[] | ||
| ) |
create leaf node, with given predictions.
| freeling::dt_node::dt_node | ( | const dt_node & | n | ) |
copy constructor
Friends And Related Function Documentation
friend class mlDTree [friend] |
Member Data Documentation
| std::vector<double> freeling::dt_node::predictions |
The documentation for this class was generated from the following file:
