[ VIGRA Homepage | Function Index | Class Index | Namespaces | File List | Main Page ]
|
OnlineLearnVisitor | ![]() |
#include <vigra/random_forest/rf_visitors.hxx>

Public Member Functions | |
| void | reset_tree (int tree_id) |
| template<class Tree, class Split, class Region, class Feature_t, class Label_t> | |
| void | visit_after_split (Tree &tree, Split &split, Region &parent, Region &leftChild, Region &rightChild, Feature_t &features, Label_t &labels) |
| template<class RF, class PR, class SM, class ST> | |
| void | visit_after_tree (RF &rf, PR &pr, SM &sm, ST &st, int index) |
| template<class RF, class PR> | |
| void | visit_at_beginning (RF &rf, const PR &pr) |
| template<class TR, class IntT, class TopT, class Feat> | |
| void | visit_internal_node (TR &tr, IntT index, TopT node_t, Feat &features) |
| void reset_tree | ( | int | tree_id | ) |
Reset a tree
| template<class Tree, class Split, class Region, class Feature_t, class Label_t> | ||||
| void visit_after_split | ( | Tree & | tree, | |
| Split & | split, | |||
| Region & | parent, | |||
| Region & | leftChild, | |||
| Region & | rightChild, | |||
| Feature_t & | features, | |||
| Label_t & | labels | |||
| ) | ||||
do something after the the Split has decided how to process the Region (Stack entry)
| tree | reference to the tree that is currently being learned | |
| split | reference to the split object | |
| parent | current stack entry which was used to decide the split | |
| leftChild | left stack entry that will be pushed | |
| rightChild | right stack entry that will be pushed. | |
| features | features matrix | |
| labels | label matrix |
Reimplemented from VisitorBase.
| template<class RF, class PR, class SM, class ST> | ||||
| void visit_after_tree | ( | RF & | rf, | |
| PR & | pr, | |||
| SM & | sm, | |||
| ST & | st, | |||
| int | index | |||
| ) | ||||
simply increase the tree count
Reimplemented from VisitorBase.
| template<class RF, class PR> | ||||
| void visit_at_beginning | ( | RF & | rf, | |
| const PR & | pr | |||
| ) | ||||
Initilize, set the number of trees
| template<class TR, class IntT, class TopT, class Feat> | ||||
| void visit_internal_node | ( | TR & | tr, | |
| IntT | index, | |||
| TopT | node_t, | |||
| Feat & | features | |||
| ) | ||||
do something when visiting a internal node during getToLeaf
remember as last node id, for finding the parent of the last external node also: adjust class counts and borders
Reimplemented from VisitorBase.
|
© Ullrich Köthe (ullrich.koethe@iwr.uni-heidelberg.de) |
html generated using doxygen and Python
|