#include <multi_class.h>
Inheritance diagram for MultiClass_Internal_Node< T >:

Public Member Functions | |
| MultiClass_Internal_Node (int search_key, Node< T > *l, Node< T > *r, Hazy_Sgd< T > *s) | |
| Constructor that initializes MultiClass_Internal_Node. | |
| void | single_entity_read (int entity_id, int &sClass) |
| Retrieves class of the entity. | |
| void | insert_example (int label, T &vec) |
| Inserts given training examples to the tree and model is updated with this example. | |
Private Member Functions | |
| int | find_direction (int label) |
| Considering the label, decisdes which sub-tree to search. | |
Private Attributes | |
| Node< T > * | l |
| Node< T > * | r |
| int | search_key |
| MultiClass_Internal_Node< T >::MultiClass_Internal_Node | ( | int | search_key, | |
| Node< T > * | l, | |||
| Node< T > * | r, | |||
| Hazy_Sgd< T > * | s | |||
| ) | [inline] |
Constructor that initializes MultiClass_Internal_Node.
| [in] | search_key | |
| [in] | l | left sub-tree |
| [in] | r | right sub-tree |
| [in] | s | list of classifiers |
| int MultiClass_Internal_Node< T >::find_direction | ( | int | label | ) | [inline, private] |
Considering the label, decisdes which sub-tree to search.
| [in] | label | class of the entity |
| void MultiClass_Internal_Node< T >::insert_example | ( | int | label, | |
| T & | vec | |||
| ) | [inline, virtual] |
Inserts given training examples to the tree and model is updated with this example.
| [in] | label | class of the training example |
| [in] | vec | feature vector of the given example |
Implements Node< T >.
| void MultiClass_Internal_Node< T >::single_entity_read | ( | int | entity_id, | |
| int & | sClass | |||
| ) | [inline, virtual] |
Retrieves class of the entity.
| [in] | entity_id | id of the entity |
| [out] | sClass | class of the entity |
Implements Node< T >.
Node<T>* MultiClass_Internal_Node< T >::l [private] |
Node<T> * MultiClass_Internal_Node< T >::r [private] |
int MultiClass_Internal_Node< T >::search_key [private] |
1.4.7