|
bool | getDeepestSiblingStates (double P, std::map< long int, SpLearningStateConcept > &states, attribute_id _x, attribute_id _y) |
|
bool | recurseToDeepestSiblingStates (double P, tree< SpLearningStateConcept >::sibling_iterator node, std::map< long int, SpLearningStateConcept > &states, attribute_id _x, attribute_id _y) |
|
bool | getMostLikelySiblingStates (double P, std::map< long int, SpLearningStateConcept > &states) |
|
void | recurseToMostLikelySiblingStates (double P, tree< SpLearningStateConcept >::sibling_iterator node, std::map< long int, SpLearningStateConcept > &states) |
|
double | categoryUtility (bool with_parent) |
|
double | categoryUtilityState (SpLearningStateConcept state, int totalN, double &totalP) |
|
double | categoryUtilityState (SpLearningStateConcept state) |
|
bool | kinshipRelation (SpLearningStateConcept state1, SpLearningStateConcept state2) |
|
tree< SpLearningStateConcept > * | getHierarchy () |
|
void | setDepth (int level) |
|
void | setDepth () |
|
int | getDepth () |
|
int | execute (SpLearningContext, SpLearningContextualisedObject, double) |
|
void | print () |
|
void | relabelTree () |
|
bool | cutoff (tree< SpLearningStateConcept >::iterator, SpInstance Instance) |
|
void | MILES (tree< SpLearningStateConcept >::iterator, SpInstance Instance, bool) |
|
int | setDistancesToLeaf (tree< SpLearningStateConcept >::sibling_iterator Node) |
|
void | setDistancesToLeaf (tree< SpLearningStateConcept >::iterator Node) |
|
void | copyEvents (SpLearningStateConcept original, SpLearningStateConcept toCopy) |
|
tree< SpLearningStateConcept >::iterator | doMerge (tree< SpLearningStateConcept >::iterator, tree< SpLearningStateConcept >::iterator, tree< SpLearningStateConcept >::iterator, SpLearningStateConcept) |
|
void | doSplit (tree< SpLearningStateConcept >::iterator, tree< SpLearningStateConcept >::iterator) |
|
int | determineBest (double, double, double, double) |
|
void | getBestChildren (tree< SpLearningStateConcept >::iterator *, tree< SpLearningStateConcept >::iterator *, tree< SpLearningStateConcept >::iterator) |
|
void | computeKParent () |
|
double * | computeKComponents (tree< SpLearningStateConcept >::iterator) |
|
void | updateChildrenProbabilities (tree< SpLearningStateConcept >::iterator) |
|
bool | isTerminal (tree< SpLearningStateConcept >::iterator) |
|
bool | isEmptyTree (tree< SpLearningStateConcept >::iterator) |
|
double | computeSplittingNode (tree< SpLearningStateConcept >::iterator, tree< SpLearningStateConcept >::iterator, SpInstance) |
|
SpLearningStateConcept | computeMergingNodes (tree< SpLearningStateConcept >::iterator, tree< SpLearningStateConcept >::iterator, tree< SpLearningStateConcept >::iterator, SpInstance) |
|
SpLearningStateConcept | mergeNodes (tree< SpLearningStateConcept >::iterator, tree< SpLearningStateConcept >::iterator) |
|
void | computeChildrenScores (tree< SpLearningStateConcept >::iterator, SpInstance) |
|
SpLearningStateConcept | computeNewChild (tree< SpLearningStateConcept >::iterator, SpInstance) |
|
void | createNewTerminal (tree< SpLearningStateConcept >::iterator, SpInstance) |
|
void | insertNewChild (tree< SpLearningStateConcept >::iterator, SpInstance) |
|
SpLearningStateConcept | copyNode (SpLearningStateConcept) |
|
SpLearningStateConcept | copyInstance (SpInstance) |
|
void | insertRoot (tree< SpLearningStateConcept >::iterator, SpInstance) |
|
void | Incorporate (SpLearningStateConcept, tree< SpLearningStateConcept >::iterator, SpInstance) |
|
void | incorporateNumericalValue (SpNumericalAttributeValuePair nodePair, SpContextualisedNumericalData instancePair, double acuity) |
|
void | incorporateSymbolicValue (SpSymbolicAttributeValuePair nodePair, SpContextualisedSymbolicData instancePair) |
|
double | incrementalMean (double, double, double, double) |
|
double | incrementalSigma (double, double, double, double, double, double) |
|