The class represents a single decision tree or a collection of decision trees.
More...
|
virtual int | getCVFolds () const =0 |
|
virtual int | getMaxCategories () const =0 |
|
virtual int | getMaxDepth () const =0 |
|
virtual int | getMinSampleCount () const =0 |
|
virtual const std::vector< Node > & | getNodes () const =0 |
| Returns all the nodes.
|
|
virtual cv::Mat | getPriors () const =0 |
| The array of a priori class probabilities, sorted by the class label value.
|
|
virtual float | getRegressionAccuracy () const =0 |
|
virtual const std::vector< int > & | getRoots () const =0 |
| Returns indices of root nodes.
|
|
virtual const std::vector
< Split > & | getSplits () const =0 |
| Returns all the splits.
|
|
virtual const std::vector< int > & | getSubsets () const =0 |
| Returns all the bitsets for categorical splits.
|
|
virtual bool | getTruncatePrunedTree () const =0 |
|
virtual bool | getUse1SERule () const =0 |
|
virtual bool | getUseSurrogates () const =0 |
|
virtual void | setCVFolds (int val)=0 |
|
virtual void | setMaxCategories (int val)=0 |
|
virtual void | setMaxDepth (int val)=0 |
|
virtual void | setMinSampleCount (int val)=0 |
|
virtual void | setPriors (const cv::Mat &val)=0 |
|
virtual void | setRegressionAccuracy (float val)=0 |
|
virtual void | setTruncatePrunedTree (bool val)=0 |
|
virtual void | setUse1SERule (bool val)=0 |
|
virtual void | setUseSurrogates (bool val)=0 |
|
virtual float | calcError (const Ptr< TrainData > &data, bool test, OutputArray resp) const |
| Computes error on the training or test dataset.
|
|
virtual bool | empty () const CV_OVERRIDE |
| Returns true if the Algorithm is empty (e.g. in the very beginning or after unsuccessful read.
|
|
virtual int | getVarCount () const =0 |
| Returns the number of variables in training samples.
|
|
virtual bool | isClassifier () const =0 |
| Returns true if the model is classifier.
|
|
virtual bool | isTrained () const =0 |
| Returns true if the model is trained.
|
|
virtual float | predict (InputArray samples, OutputArray results=noArray(), int flags=0) const =0 |
| Predicts response(s) for the provided sample(s)
|
|
virtual bool | train (const Ptr< TrainData > &trainData, int flags=0) |
| Trains the statistical model.
|
|
virtual bool | train (InputArray samples, int layout, InputArray responses) |
| Trains the statistical model.
|
|
| Algorithm () |
|
virtual | ~Algorithm () |
|
virtual void | clear () |
| Clears the algorithm state.
|
|
virtual String | getDefaultName () const |
|
virtual void | read (const FileNode &fn) |
| Reads algorithm parameters from a file storage.
|
|
virtual void | save (const String &filename) const |
|
virtual void | write (FileStorage &fs) const |
| Stores algorithm parameters in a file storage.
|
|
void | write (const Ptr< FileStorage > &fs, const String &name=String()) const |
| simplified API for language bindingsThis is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
|
|
The class represents a single decision tree or a collection of decision trees.
The current public interface of the class allows user to train only a single decision tree, however the class is capable of storing multiple decision trees and using them for prediction (by summing responses or using a voting schemes), and the derived from DTrees classes (such as RTrees and Boost) use this capability to implement decision tree ensembles.
- See Also
- Decision Trees
virtual int cv::ml::DTrees::getMaxCategories |
( |
| ) |
const |
|
pure virtual |
Cluster possible values of a categorical variable into K\<=maxCategories clusters to
find a suboptimal split. If a discrete variable, on which the training procedure tries to make a split, takes more than maxCategories values, the precise best subset estimation may take a very long time because the algorithm is exponential. Instead, many decision trees engines (including our implementation) try to find sub-optimal split in this case by clustering all the samples into maxCategories clusters that is some categories are merged together. The clustering is applied only in n > 2-class classification problems for categorical variables with N > max_categories possible values. In case of regression and 2-class classification the optimal split can be found efficiently without employing clustering, thus the parameter is not used in these cases. Default value is 10.
- See Also
- setMaxCategories
virtual cv::Mat cv::ml::DTrees::getPriors |
( |
| ) |
const |
|
pure virtual |
The array of a priori class probabilities, sorted by the class label value.
The parameter can be used to tune the decision tree preferences toward a certain class. For example, if you want to detect some rare anomaly occurrence, the training base will likely contain much more normal cases than anomalies, so a very good classification performance will be achieved just by considering every case as normal. To avoid this, the priors can be specified, where the anomaly probability is artificially increased (up to 0.5 or even greater), so the weight of the misclassified anomalies becomes much bigger, and the tree is adjusted properly.
You can also think about this parameter as weights of prediction categories which determine relative weights that you give to misclassification. That is, if the weight of the first category is 1 and the weight of the second category is 10, then each mistake in predicting the second category is equivalent to making 10 mistakes in predicting the first category. Default value is empty Mat.
- See Also
- setPriors