#include <TreeClassifier.h>
Inheritance diagram for prapi::TreeClassifier< T, I, C >:

It Classifies root's given with function addChild. Every root have to give a Classifier which contains the information how the specified root should be classified. Remember that the template parameter T is spesified for List<T>, that means you have to give a list of Features for TreeClassifier.
Public Methods | |
| TreeClassifier (Classifier< List< T >, I, C > *classifier, IntegerList classes) | |
| Create a new TreeClassifier node. | |
| virtual | ~TreeClassifier () |
| NOTE destructor deletes all the children when it is deleted. | |
| void | addChild (TreeClassifier< T, I, C > *child, int rootIndex) throw (TreeClassificationException&) |
| AddChild funtion adds the childer for TreeClassifier. | |
| TreeClassifier< T, I, C > * | getChild (int rootIndex) throw (TreeClassificationException&) |
| Get the child node of this TreeClassifier from rootNumber given. | |
| void | holdOut (List< Sample< List< T >, I, C > > &lst) throw (TreeClassificationException&) |
| Perform a holdout test using the given samples as testing data for all of the roots. | |
| void | leaveOneOut (void) throw (TreeClassificationException&) |
| Perform a leave-one-out test on the training data for all of the roots. | |
| void | collectClassification (List< Sample< List< T >, I, C > > &resultList) |
| Funktion which collects the classification from samples. | |
| void | print (ostream &out, List< string > &lst, int depth=0) |
| Funktion which prints the TreeCalssifier. | |
| void | buildTreeClassifier (List< Sample< List< T >, I, C > > &trainingSamples, int classCount, double limitValue, int numberOfDividingTests=10, double changeOfLimitValue=0.01) throw (TreeClassificationException&) |
| Function buildTreeClassifier. | |
| void | setTrainingSamples (List< Sample< List< T >, I, C > > &sampleList) |
| Set the training samples for TreeClassifier. | |
|
List< Sample< List< T >, I, C > > & | getTrainingSamples () |
| Get the Training samples from TreeClassifier. | |
|
||||||||||||||||
|
Create a new TreeClassifier node. NOTE you must do every child TreeClassifier with new operator therefor that the deleting of those pointers will be done right.
|
|
||||||||||||||||
|
AddChild funtion adds the childer for TreeClassifier. Remember that the first root index is zero.
|
|
||||||||||||||||||||||||||||
|
Function buildTreeClassifier.
|
|
||||||||||
|
Funktion which collects the classification from samples.
|
|
||||||||||
|
Get the child node of this TreeClassifier from rootNumber given.
|
|
||||||||||
|
Perform a holdout test using the given samples as testing data for all of the roots.
|
|
||||||||||||||||||||
|
Funktion which prints the TreeCalssifier.
|