, including all inherited members.
allExp | M5Tree | [private] |
allNodes | M5Tree | [private] |
allocateNode() | M5Tree | |
ALLOW_ALL_FEATS | M5Tree | [private] |
buildTree(tree_node *node, const std::vector< tree_experience * > &instances, bool changed) | M5Tree | |
calcSDforSet(const std::vector< tree_experience * > &instances) | M5Tree | |
calcSDR(int dim, float val, const std::vector< tree_experience * > &instances, float sd, std::vector< tree_experience * > &left, std::vector< tree_experience * > &right) | M5Tree | |
compareSplits(float sdr, int dim, float val, const std::vector< tree_experience * > &left, const std::vector< tree_experience * > &right, int *nties, float *bestSDR, int *bestDim, float *bestVal, std::vector< tree_experience * > *bestLeft, std::vector< tree_experience * > *bestRight) | M5Tree | |
COPYDEBUG | M5Tree | |
copyTree(tree_node *newNode, tree_node *origNode) | M5Tree | |
deallocateNode(tree_node *node) | M5Tree | |
deleteTree(tree_node *node) | M5Tree | |
DTDEBUG | M5Tree | |
experiences | M5Tree | [private] |
featPct | M5Tree | [private] |
fitLinearModel(tree_node *node, const std::vector< tree_experience * > &instances, std::vector< bool > featureMask, int nFeats, float *resSum) | M5Tree | |
fitSimpleLinearModel(tree_node *node, const std::vector< tree_experience * > &instances, std::vector< bool > featureMask, int nFeats, float *resSum) | M5Tree | |
freeNodes | M5Tree | [private] |
freq | M5Tree | [private] |
getConf(const std::vector< float > &input) | M5Tree | [virtual] |
getCopy() | M5Tree | [virtual] |
getCorrectChild(tree_node *node, const std::vector< float > &input) | M5Tree | |
getFeatsUsed(tree_node *node, std::vector< bool > *featsUsed) | M5Tree | |
getUniques(int dim, const std::vector< tree_experience * > &instances, float &minVal, float &maxVal) | M5Tree | |
hadError | M5Tree | [private] |
id | M5Tree | [private] |
implementSplit(tree_node *node, const std::vector< tree_experience * > &instances, float bestSDR, int bestDim, float bestVal, const std::vector< tree_experience * > &left, const std::vector< tree_experience * > &right, bool changed) | M5Tree | |
INCDEBUG | M5Tree | |
initNodes() | M5Tree | |
initTree() | M5Tree | |
initTreeNode(tree_node *node) | M5Tree | |
lastNode | M5Tree | [private] |
leafPrediction(tree_node *t, const std::vector< float > &in, std::map< float, float > *retval) | M5Tree | |
LMDEBUG | M5Tree | |
M | M5Tree | [private] |
M5Tree(int id, int trainMode, int trainFreq, int m, float featPct, bool simple, bool allowAllFeats, float min_sdr, Random rng) | M5Tree | |
M5Tree(const M5Tree &) | M5Tree | |
makeLeaf(tree_node *node) | M5Tree | |
maxnodes | M5Tree | [private] |
MIN_SDR | M5Tree | [private] |
mode | M5Tree | [private] |
nExperiences | M5Tree | |
nfeat | M5Tree | [private] |
nnodes | M5Tree | [private] |
NODEDEBUG | M5Tree | |
nOutput | M5Tree | [private] |
passTest(int dim, float val, const std::vector< float > &input) | M5Tree | |
printTree(tree_node *t, int level) | M5Tree | |
pruneTree(tree_node *node, const std::vector< tree_experience * > &instances) | M5Tree | |
rebuildTree() | M5Tree | |
removeChildren(tree_node *node) | M5Tree | |
rng | M5Tree | [private] |
root | M5Tree | [private] |
SIMPLE | M5Tree | [private] |
sortOnDim(int dim, const std::vector< tree_experience * > &instances) | M5Tree | |
SPLIT_MARGIN | M5Tree | |
SPLITDEBUG | M5Tree | |
STOCH_DEBUG | M5Tree | |
testInstance(const std::vector< float > &input, std::map< float, float > *retval) | M5Tree | [virtual] |
testPossibleSplits(const std::vector< tree_experience * > &instances, float *bestSDR, int *bestDim, float *bestVal, std::vector< tree_experience * > *bestLeft, std::vector< tree_experience * > *bestRight) | M5Tree | |
totalnodes | M5Tree | [private] |
trainInstance(classPair &instance) | M5Tree | [virtual] |
trainInstances(std::vector< classPair > &instances) | M5Tree | [virtual] |
traverseTree(tree_node *node, const std::vector< float > &input) | M5Tree | |
~Classifier() | Classifier | [virtual] |
~M5Tree() | M5Tree | |