use of org.knime.base.node.mine.decisiontree2.model.DecisionTreeNode in project knime-core by knime.
the class DecTreePredictorGraphView method recreateHiLite.
private void recreateHiLite() {
Set<RowKey> hilited = m_hiLiteHdl.getHiLitKeys();
Set<DecisionTreeNode> toHilite = new HashSet<DecisionTreeNode>();
DecisionTreeNode root = m_graph.getRootNode();
List<DecisionTreeNode> toProcess = new LinkedList<DecisionTreeNode>();
if (null != root) {
toProcess.add(0, root);
}
// Traverse the tree breadth first
while (!toProcess.isEmpty()) {
DecisionTreeNode curr = toProcess.remove(0);
if (hilited.containsAll(curr.coveredPattern())) {
// hilite subtree starting from curr
toHilite.addAll(getSubtree(curr));
} else {
for (int i = 0; i < curr.getChildCount(); i++) {
toProcess.add(0, curr.getChildAt(i));
}
}
}
m_graph.hiLite(toHilite);
}
use of org.knime.base.node.mine.decisiontree2.model.DecisionTreeNode in project knime-core by knime.
the class DecTreePredictorGraphView method getSubtree.
private List<DecisionTreeNode> getSubtree(final DecisionTreeNode node) {
List<DecisionTreeNode> subTree = new ArrayList<DecisionTreeNode>();
List<DecisionTreeNode> toProcess = new LinkedList<DecisionTreeNode>();
toProcess.add(0, node);
// Traverse the tree breadth first
while (!toProcess.isEmpty()) {
DecisionTreeNode curr = toProcess.remove(0);
subTree.add(curr);
for (int i = 0; i < curr.getChildCount(); i++) {
toProcess.add(0, curr.getChildAt(i));
}
}
return subTree;
}
use of org.knime.base.node.mine.decisiontree2.model.DecisionTreeNode in project knime-core by knime.
the class RegressionTreeLearnerNodeView method createTreeMenu.
/**
* Create menu to control tree.
*
* @return A new JMenu with tree operation buttons
*/
private JMenu createTreeMenu() {
final JMenu result = new JMenu("Tree");
result.setMnemonic('T');
Action expand = new ExpandBranchAction<DecisionTreeNode>(m_graph);
expand.putValue(Action.NAME, "Expand Selected Branch");
Action collapse = new CollapseBranchAction<DecisionTreeNode>(m_graph);
collapse.putValue(Action.NAME, "Collapse Selected Branch");
result.add(expand);
result.add(collapse);
return result;
}
use of org.knime.base.node.mine.decisiontree2.model.DecisionTreeNode in project knime-core by knime.
the class RegressionTreeLearnerNodeView method getSubtree.
private List<DecisionTreeNode> getSubtree(final DecisionTreeNode node) {
List<DecisionTreeNode> subTree = new ArrayList<DecisionTreeNode>();
List<DecisionTreeNode> toProcess = new LinkedList<DecisionTreeNode>();
toProcess.add(0, node);
// Traverse the tree breadth first
while (!toProcess.isEmpty()) {
DecisionTreeNode curr = toProcess.remove(0);
subTree.add(curr);
for (int i = 0; i < curr.getChildCount(); i++) {
toProcess.add(0, curr.getChildAt(i));
}
}
return subTree;
}
use of org.knime.base.node.mine.decisiontree2.model.DecisionTreeNode in project knime-core by knime.
the class DecTreeLearnerGraphView method createTreeMenu.
/**
* Create menu to control tree.
*
* @return A new JMenu with tree operation buttons
*/
private JMenu createTreeMenu() {
final JMenu result = new JMenu("Tree");
result.setMnemonic('T');
Action expand = new ExpandBranchAction<DecisionTreeNode>(m_graph);
expand.putValue(Action.NAME, "Expand Selected Branch");
Action collapse = new CollapseBranchAction<DecisionTreeNode>(m_graph);
collapse.putValue(Action.NAME, "Collapse Selected Branch");
result.add(expand);
result.add(collapse);
return result;
}
Aggregations