, including all inherited members.
| allExp | LinearSplitsTree | [private] |
| allNodes | LinearSplitsTree | [private] |
| allocateNode() | LinearSplitsTree | |
| buildTree(tree_node *node, const std::vector< tree_experience * > &instances, bool changed) | LinearSplitsTree | |
| calcAvgErrorforSet(const std::vector< tree_experience * > &instances) | LinearSplitsTree | |
| calcER(int dim, float val, const std::vector< tree_experience * > &instances, float error, std::vector< tree_experience * > &left, std::vector< tree_experience * > &right, float *leftError, float *rightError) | LinearSplitsTree | |
| compareSplits(float er, int dim, float val, const std::vector< tree_experience * > &left, const std::vector< tree_experience * > &right, int *nties, float leftError, float rightError, float *bestER, int *bestDim, float *bestVal, std::vector< tree_experience * > *bestLeft, std::vector< tree_experience * > *bestRight, float *bestLeftError, float *bestRightError) | LinearSplitsTree | |
| COPYDEBUG | LinearSplitsTree | |
| copyTree(tree_node *newNode, tree_node *origNode) | LinearSplitsTree | |
| deallocateNode(tree_node *node) | LinearSplitsTree | |
| deleteTree(tree_node *node) | LinearSplitsTree | |
| DTDEBUG | LinearSplitsTree | |
| experiences | LinearSplitsTree | [private] |
| featPct | LinearSplitsTree | [private] |
| fitMultiLinearModel(const std::vector< tree_experience * > &instances, float *constant, std::vector< float > *coeff) | LinearSplitsTree | |
| fitSimpleLinearModel(const std::vector< tree_experience * > &instances, float *constant, std::vector< float > *coeff) | LinearSplitsTree | |
| freeNodes | LinearSplitsTree | [private] |
| freq | LinearSplitsTree | [private] |
| getConf(const std::vector< float > &input) | LinearSplitsTree | [virtual] |
| getCopy() | LinearSplitsTree | [virtual] |
| getCorrectChild(tree_node *node, const std::vector< float > &input) | LinearSplitsTree | |
| getUniques(int dim, const std::vector< tree_experience * > &instances, float &minVal, float &maxVal) | LinearSplitsTree | |
| hadError | LinearSplitsTree | [private] |
| id | LinearSplitsTree | [private] |
| implementSplit(tree_node *node, const std::vector< tree_experience * > &instances, float bestER, int bestDim, float bestVal, const std::vector< tree_experience * > &left, const std::vector< tree_experience * > &right, bool changed, float leftError, float rightError) | LinearSplitsTree | |
| INCDEBUG | LinearSplitsTree | |
| initNodes() | LinearSplitsTree | |
| initTree() | LinearSplitsTree | |
| initTreeNode(tree_node *node) | LinearSplitsTree | |
| lastNode | LinearSplitsTree | [private] |
| leafPrediction(tree_node *t, const std::vector< float > &in, std::map< float, float > *retval) | LinearSplitsTree | |
| LinearSplitsTree(int id, int trainMode, int trainFreq, int m, float featPct, bool simple, float min_er, Random rng) | LinearSplitsTree | |
| LinearSplitsTree(const LinearSplitsTree &) | LinearSplitsTree | |
| LMDEBUG | LinearSplitsTree | |
| M | LinearSplitsTree | [private] |
| makeLeaf(tree_node *node, const std::vector< tree_experience * > &instances) | LinearSplitsTree | |
| maxnodes | LinearSplitsTree | [private] |
| MIN_ER | LinearSplitsTree | [private] |
| mode | LinearSplitsTree | [private] |
| nExperiences | LinearSplitsTree | |
| nnodes | LinearSplitsTree | [private] |
| NODEDEBUG | LinearSplitsTree | |
| nOutput | LinearSplitsTree | [private] |
| passTest(int dim, float val, const std::vector< float > &input) | LinearSplitsTree | |
| printTree(tree_node *t, int level) | LinearSplitsTree | |
| rebuildTree() | LinearSplitsTree | |
| rng | LinearSplitsTree | [private] |
| root | LinearSplitsTree | [private] |
| SIMPLE | LinearSplitsTree | [private] |
| sortOnDim(int dim, const std::vector< tree_experience * > &instances) | LinearSplitsTree | |
| SPLIT_MARGIN | LinearSplitsTree | |
| SPLITDEBUG | LinearSplitsTree | |
| STOCH_DEBUG | LinearSplitsTree | |
| testInstance(const std::vector< float > &input, std::map< float, float > *retval) | LinearSplitsTree | [virtual] |
| testPossibleSplits(float avgError, const std::vector< tree_experience * > &instances, float *bestER, int *bestDim, float *bestVal, std::vector< tree_experience * > *bestLeft, std::vector< tree_experience * > *bestRight, float *bestLeftError, float *bestRightError) | LinearSplitsTree | |
| totalnodes | LinearSplitsTree | [private] |
| trainInstance(classPair &instance) | LinearSplitsTree | [virtual] |
| trainInstances(std::vector< classPair > &instances) | LinearSplitsTree | [virtual] |
| traverseTree(tree_node *node, const std::vector< float > &input) | LinearSplitsTree | |
| ~Classifier() | Classifier | [virtual] |
| ~LinearSplitsTree() | LinearSplitsTree | |