Package org.apache.mahout.classifier.df.node

Examples of org.apache.mahout.classifier.df.node.NumericalNode

256
257
258
259
260
261
262
263
264
265
266
        selected = temp;
      } else {
        selected[best.getAttr()] = alreadySelected;
      }

      childNode = new NumericalNode(best.getAttr(), best.getSplit(), loChild, hiChild);
    } else { // CATEGORICAL attribute
      double[] values = data.values(best.getAttr());

      // tree is complemented
      Collection<Double> subsetValues = null;
View Full Code Here
67
68
69
70
71
72
73
74
75
76
77
          buff.append(attrNames == null ? attr : attrNames[attr]).append(" = ")
              .append(attrValues[attr][i]);
          buff.append(toStringNode(childs[index], dataset, attrNames, fields, layer + 1));
        }
      } else if (node instanceof NumericalNode) {
        NumericalNode nnode = (NumericalNode) node;
        int attr = (Integer) fields.get("NumericalNode.attr").get(nnode);
        double split = (Double) fields.get("NumericalNode.split").get(nnode);
        Node loChild = (Node) fields.get("NumericalNode.loChild").get(nnode);
        Node hiChild = (Node) fields.get("NumericalNode.hiChild").get(nnode);
        buff.append('\n');
View Full Code Here
188
189
190
191
192
193
194
195
196
197
198
          buff.append(" -> ");
          buff.append(toStringPredict(childs[index], instance, dataset,
              attrNames, fields));
        }
      } else if (node instanceof NumericalNode) {
        NumericalNode nnode = (NumericalNode) node;
        int attr = (Integer) fields.get("NumericalNode.attr").get(nnode);
        double split = (Double) fields.get("NumericalNode.split").get(nnode);
        Node loChild = (Node) fields.get("NumericalNode.loChild").get(nnode);
        Node hiChild = (Node) fields.get("NumericalNode.hiChild").get(nnode);
       
View Full Code Here
105
106
107
108
109
110
111
112
113
114
115
116
117
  }
 
  @Test
  public void testForestVisualize() throws Exception {
    // Tree
    NumericalNode root = new NumericalNode(2, 90, new Leaf(0),
        new CategoricalNode(0, new double[] {0, 1, 2}, new Node[] {
            new NumericalNode(1, 71, new Leaf(0), new Leaf(1)), new Leaf(1),
            new Leaf(0)}));
    List<Node> trees = Lists.newArrayList();
    trees.add(root);
   
    // Forest
View Full Code Here
254
255
256
257
258
259
260
261
262
263
264
        selected = temp;
      } else {
        selected[best.getAttr()] = alreadySelected;
      }

      childNode = new NumericalNode(best.getAttr(), best.getSplit(), loChild, hiChild);
    } else { // CATEGORICAL attribute
      double[] values = data.values(best.getAttr());

      // tree is complemented
      Collection<Double> subsetValues = null;
View Full Code Here
131
132
133
134
135
136
137
138
139
140
141
        selected = temp;
      } else {
        selected[best.getAttr()] = alreadySelected;
      }

      childNode = new NumericalNode(best.getAttr(), best.getSplit(), loChild, hiChild);
    } else { // CATEGORICAL attribute
      selected[best.getAttr()] = true;

      double[] values = data.values(best.getAttr());
      Node[] children = new Node[values.length];
View Full Code Here
64
65
66
67
68
69
70
71
72
73
74
        if (index >= 0) {
          buff.append(toStringNode(childs[index], dataset, attrNames, fields, layer + 1));
        }
      }
    } else if (node instanceof NumericalNode) {
      NumericalNode nnode = (NumericalNode) node;
      int attr = (Integer) fields.get("NumericalNode.attr").get(nnode);
      double split = (Double) fields.get("NumericalNode.split").get(nnode);
      Node loChild = (Node) fields.get("NumericalNode.loChild").get(nnode);
      Node hiChild = (Node) fields.get("NumericalNode.hiChild").get(nnode);
      buff.append('\n');
View Full Code Here
172
173
174
175
176
177
178
179
180
181
182
          + attrValues[attr][(int) instance.get(attr)]);
        buff.append(" -> ");
        buff.append(toStringPredict(childs[index], instance, dataset, attrNames, fields));
      }
    } else if (node instanceof NumericalNode) {
      NumericalNode nnode = (NumericalNode) node;
      int attr = (Integer) fields.get("NumericalNode.attr").get(nnode);
      double split = (Double) fields.get("NumericalNode.split").get(nnode);
      Node loChild = (Node) fields.get("NumericalNode.loChild").get(nnode);
      Node hiChild = (Node) fields.get("NumericalNode.hiChild").get(nnode);
View Full Code Here
256
257
258
259
260
261
262
263
264
265
266
        selected = temp;
      } else {
        selected[best.getAttr()] = alreadySelected;
      }

      childNode = new NumericalNode(best.getAttr(), best.getSplit(), loChild, hiChild);
    } else { // CATEGORICAL attribute
      double[] values = data.values(best.getAttr());

      // tree is complemented
      Collection<Double> subsetValues = null;
View Full Code Here
100
101
102
103
104
105
106
107
108
109
110
111
112
  }
 
  @Test
  public void testForestVisualize() throws Exception {
    // Tree
    NumericalNode root = new NumericalNode(2, 90, new Leaf(0),
      new CategoricalNode(0, new double[] {0, 1, 2}, new Node[] {
        new NumericalNode(1, 71, new Leaf(0), new Leaf(1)), new Leaf(1),
        new Leaf(0)}));
    List<Node> trees = new ArrayList<Node>();
    trees.add(root);
   
    // Forest
View Full Code Here
TOP

Related Classes of org.apache.mahout.classifier.df.node.NumericalNode

  • org.apache.mahout.classifier.df.builder.DecisionTreeBuilder
  • org.apache.mahout.classifier.df.builder.DefaultTreeBuilder
  • org.apache.mahout.classifier.df.tools.TreeVisualizer
  • org.apache.mahout.classifier.df.tools.VisualizerTest
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.