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

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

316
317
318
319
320
321
322
323
324
325
        children[index] = build(rng, subsets[index]);
      }

      selected[best.getAttr()] = alreadySelected;

      childNode = new CategoricalNode(best.getAttr(), values, children);
    }

    return childNode;
  }
View Full Code Here
48
49
50
51
52
53
54
55
56
57
58
   
    StringBuilder buff = new StringBuilder();
   
    try {
      if (node instanceof CategoricalNode) {
        CategoricalNode cnode = (CategoricalNode) node;
        int attr = (Integer) fields.get("CategoricalNode.attr").get(cnode);
        double[] values = (double[]) fields.get("CategoricalNode.values").get(cnode);
        Node[] childs = (Node[]) fields.get("CategoricalNode.childs").get(cnode);
        String[][] attrValues = (String[][]) fields.get("Dataset.values").get(dataset);
        for (int i = 0; i < attrValues[attr].length; i++) {
View Full Code Here
170
171
172
173
174
175
176
177
178
179
180
      Dataset dataset, String[] attrNames, Map<String,Field> fields) {
    StringBuilder buff = new StringBuilder();
   
    try {
      if (node instanceof CategoricalNode) {
        CategoricalNode cnode = (CategoricalNode) node;
        int attr = (Integer) fields.get("CategoricalNode.attr").get(cnode);
        double[] values = (double[]) fields.get("CategoricalNode.values").get(
            cnode);
        Node[] childs = (Node[]) fields.get("CategoricalNode.childs")
            .get(cnode);
View Full Code Here
314
315
316
317
318
319
320
321
322
323
        children[index] = build(rng, subsets[index]);
      }

      selected[best.getAttr()] = alreadySelected;

      childNode = new CategoricalNode(best.getAttr(), values, children);
    }

    return childNode;
  }
View Full Code Here
145
146
147
148
149
150
151
152
153
154
        children[index] = build(rng, subset);
      }

      selected[best.getAttr()] = alreadySelected;

      childNode = new CategoricalNode(best.getAttr(), values, children);
    }

    return childNode;
  }
View Full Code Here
106
107
108
109
110
111
112
113
114
115
116
 
  @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);
   
View Full Code Here
47
48
49
50
51
52
53
54
55
56
57
  private static String toStringNode(Node node, Dataset dataset, String[] attrNames,
    Map<String, Field> fields, int layer) throws IllegalAccessException {
    StringBuilder buff = new StringBuilder();

    if (node instanceof CategoricalNode) {
      CategoricalNode cnode = (CategoricalNode) node;
      int attr = (Integer) fields.get("CategoricalNode.attr").get(cnode);
      double[] values = (double[]) fields.get("CategoricalNode.values").get(cnode);
      Node[] childs = (Node[]) fields.get("CategoricalNode.childs").get(cnode);
      String[][] attrValues = (String[][]) fields.get("Dataset.values").get(dataset);
      for (int i = 0; i < childs.length; i++) {
View Full Code Here
158
159
160
161
162
163
164
165
166
167
168
  private static String toStringPredict(Node node, Instance instance, Dataset dataset,
    String[] attrNames, Map<String, Field> fields) throws IllegalAccessException {
    StringBuilder buff = new StringBuilder();

    if (node instanceof CategoricalNode) {
      CategoricalNode cnode = (CategoricalNode) node;
      int attr = (Integer) fields.get("CategoricalNode.attr").get(cnode);
      double[] values = (double[]) fields.get("CategoricalNode.values").get(cnode);
      Node[] childs = (Node[]) fields.get("CategoricalNode.childs").get(cnode);
      String[][] attrValues = (String[][]) fields.get("Dataset.values").get(dataset);
View Full Code Here
316
317
318
319
320
321
322
323
324
325
        children[index] = build(rng, subsets[index]);
      }

      selected[best.getAttr()] = alreadySelected;

      childNode = new CategoricalNode(best.getAttr(), values, children);
    }

    return childNode;
  }
View Full Code Here
101
102
103
104
105
106
107
108
109
110
111
 
  @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);
   
View Full Code Here
TOP

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

  • 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.