Package | Description |
---|---|
weka.classifiers.trees |
Modifier and Type | Field and Description |
---|---|
protected LADTree.PredictionNode |
LADTree.m_root |
protected LADTree.PredictionNode |
LADTree.m_search_bestInsertionNode |
Modifier and Type | Method and Description |
---|---|
abstract LADTree.PredictionNode |
LADTree.Splitter.getChildForBranch(int branchNum) |
LADTree.PredictionNode |
LADTree.TwoWayNominalSplit.getChildForBranch(int branchNum) |
LADTree.PredictionNode |
LADTree.TwoWayNumericSplit.getChildForBranch(int branchNum) |
Modifier and Type | Method and Description |
---|---|
protected void |
LADTree.graphTraverse(LADTree.PredictionNode currentNode,
StringBuffer text,
int splitOrder,
int predOrder)
Traverses the tree, graphing each node.
|
void |
LADTree.PredictionNode.merge(LADTree.PredictionNode merger) |
protected int |
LADTree.numOfAllNodes(LADTree.PredictionNode root)
Returns the total number of nodes in a tree.
|
protected int |
LADTree.numOfLeafNodes(LADTree.PredictionNode root)
Returns the number of leaf nodes in a tree.
|
protected int |
LADTree.numOfPredictionNodes(LADTree.PredictionNode root)
Returns the number of prediction nodes in a tree.
|
abstract void |
LADTree.Splitter.setChildForBranch(int branchNum,
LADTree.PredictionNode childPredictor) |
void |
LADTree.TwoWayNominalSplit.setChildForBranch(int branchNum,
LADTree.PredictionNode childPredictor) |
void |
LADTree.TwoWayNumericSplit.setChildForBranch(int branchNum,
LADTree.PredictionNode childPredictor) |
Copyright © 2015 University of Waikato, Hamilton, NZ. All rights reserved.