, including all inherited members.
allExp | C45Tree | [private] |
allNodes | C45Tree | [private] |
allocateNode() | C45Tree | |
ALLOW_ONLY_SPLITS | C45Tree | [private] |
buildTree(tree_node *node, const std::vector< tree_experience * > &instances, bool changed) | C45Tree | |
C45Tree(int id, int trainMode, int trainFreq, int m, float featPct, Random rng) | C45Tree | |
C45Tree(const C45Tree &) | C45Tree | |
calcGainRatio(int dim, float val, bool type, const std::vector< tree_experience * > &instances, float I, std::vector< tree_experience * > &left, std::vector< tree_experience * > &right) | C45Tree | |
calcIforSet(const std::vector< tree_experience * > &instances) | C45Tree | |
calcIofP(float *P, int size) | C45Tree | |
compareSplits(float gainRatio, int dim, float val, bool type, const std::vector< tree_experience * > &left, const std::vector< tree_experience * > &right, int *nties, float *bestGainRatio, int *bestDim, float *bestVal, bool *bestType, std::vector< tree_experience * > *bestLeft, std::vector< tree_experience * > *bestRight) | C45Tree | |
COPYDEBUG | C45Tree | |
copyTree(tree_node *newNode, tree_node *origNode) | C45Tree | |
CUT enum value | C45Tree | |
deallocateNode(tree_node *node) | C45Tree | |
deleteTree(tree_node *node) | C45Tree | |
DTDEBUG | C45Tree | |
experiences | C45Tree | [private] |
featPct | C45Tree | [private] |
freeNodes | C45Tree | [private] |
freq | C45Tree | [private] |
getConf(const std::vector< float > &input) | C45Tree | [virtual] |
getCopy() | C45Tree | [virtual] |
getCorrectChild(tree_node *node, const std::vector< float > &input) | C45Tree | |
getUniques(int dim, const std::vector< tree_experience * > &instances, float &minVal, float &maxVal) | C45Tree | |
hadError | C45Tree | [private] |
id | C45Tree | [private] |
implementSplit(tree_node *node, float bestGainRatio, int bestDim, float bestVal, bool bestType, const std::vector< tree_experience * > &left, const std::vector< tree_experience * > &right, bool changed) | C45Tree | |
INCDEBUG | C45Tree | |
initNodes() | C45Tree | |
initTree() | C45Tree | |
initTreeNode(tree_node *node) | C45Tree | |
lastNode | C45Tree | [private] |
M | C45Tree | [private] |
makeLeaf(tree_node *node) | C45Tree | |
maxnodes | C45Tree | [private] |
MIN_GAIN_RATIO | C45Tree | |
mode | C45Tree | [private] |
nExperiences | C45Tree | |
nnodes | C45Tree | [private] |
NODEDEBUG | C45Tree | |
nOutput | C45Tree | [private] |
ONLY enum value | C45Tree | |
outputProbabilities(tree_node *t, std::map< float, float > *retval) | C45Tree | |
passTest(int dim, float val, bool type, const std::vector< float > &input) | C45Tree | |
printTree(tree_node *t, int level) | C45Tree | |
rebuildTree() | C45Tree | |
rng | C45Tree | [private] |
root | C45Tree | [private] |
sortOnDim(int dim, const std::vector< tree_experience * > &instances) | C45Tree | |
SPLIT_MARGIN | C45Tree | |
SPLITDEBUG | C45Tree | |
splitTypes enum name | C45Tree | |
STOCH_DEBUG | C45Tree | |
testInstance(const std::vector< float > &input, std::map< float, float > *retval) | C45Tree | [virtual] |
testPossibleSplits(const std::vector< tree_experience * > &instances, float *bestGainRatio, int *bestDim, float *bestVal, bool *bestType, std::vector< tree_experience * > *bestLeft, std::vector< tree_experience * > *bestRight) | C45Tree | |
totalnodes | C45Tree | [private] |
trainInstance(classPair &instance) | C45Tree | [virtual] |
trainInstances(std::vector< classPair > &instances) | C45Tree | [virtual] |
traverseTree(tree_node *node, const std::vector< float > &input) | C45Tree | |
~C45Tree() | C45Tree | |
~Classifier() | Classifier | [virtual] |