Examples of Leaf

Examples of org.apache.mahout.df.node.Leaf

77
78
79
80
81
82
83
84
85
      for (int index = 0; index < nbMapTrees; index++, treeIndex++) {
        keys[treeIndex] = new TreeID(partition, treeIndex);

        // put the tree index in the leaf's label
        // this way we can check the stored data
        trees[treeIndex] = new Leaf(treeIndex);
      }
    }
  }
View Full Code Here

Examples of org.apache.mahout.df.node.Leaf

61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
  @Override
  public Node build(Random rng, Data data) {

    if (data.isEmpty())
      return new Leaf(-1);
    if (data.isIdentical())
      return new Leaf(data.majorityLabel(rng));
    if (data.identicalLabel())
      return new Leaf(data.get(0).label);

    int[] attributes = randomAttributes(data.getDataset(), rng, m);

    // find the best split
    Split best = null;
View Full Code Here

Examples of org.apache.mahout.df.node.Leaf

134
135
136
137
138
139
140
141
142
143
144
      partitions.add(partition);

      int nbTrees = Step1Mapper.nbTrees(numMaps, numTrees, partition);

      for (int treeId = 0; treeId < nbTrees; treeId++) {
        Node tree = new Leaf(rng.nextInt(100));

        keys[index] = new TreeID(partition, treeId);
        values[index] = new MapredOutput(tree, nextIntArray(rng, numInstances));

        index++;
View Full Code Here

Examples of org.apache.mahout.df.node.Leaf

90
91
92
93
94
95
96
97
98
99
100
      for (int tree = 0; tree < nbMapTrees; tree++, treeIndex++) {
        keys[treeIndex] = new TreeID(partition, treeIndex);
        // put the partition in the leaf's label
        // this way we can track the outputs
        trees[treeIndex] = new Leaf(partition);
      }
     
      sizes[partition] = splits[partition].length;
    }
View Full Code Here

Examples of org.apache.mahout.df.node.Leaf

36
37
38
39
40
41
42
    public Node build(Random rng, Data data) {
      for (int index = 0; index < data.size(); index++) {
        assertTrue(expected.contains(data.get(index)));
      }

      return new Leaf(-1);
    }
View Full Code Here

Examples of org.apache.mahout.df.node.Leaf

134
135
136
137
138
139
140
141
142
143
144
      partitions.add(partition);

      int nbTrees = Step1Mapper.nbTrees(numMaps, numTrees, partition);

      for (int treeId = 0; treeId < nbTrees; treeId++) {
        Node tree = new Leaf(rng.nextInt(100));

        keys[index] = new TreeID(partition, treeId);
        values[index] = new MapredOutput(tree, nextIntArray(rng, numInstances));

        index++;
View Full Code Here

Examples of org.apache.mahout.df.node.Leaf

88
89
90
91
92
93
94
95
96
97
98
      for (int tree = 0; tree < nbMapTrees; tree++, treeIndex++) {
        keys[treeIndex] = new TreeID(partition, treeIndex);
        // put the partition in the leaf's label
        // this way we can track the outputs
        trees[treeIndex] = new Leaf(partition);
      }

      sizes[partition] = splits[partition].length;
    }
View Full Code Here

Examples of org.apache.mahout.df.node.Leaf

36
37
38
39
40
41
42
    public Node build(Random rng, Data data) {
      for (int index = 0; index < data.size(); index++) {
        assertTrue(expected.contains(data.get(index)));
      }

      return new Leaf(-1);
    }
View Full Code Here

Examples of org.apache.mahout.df.node.Leaf

78
79
80
81
82
83
84
85
86
      for (int index = 0; index < nbMapTrees; index++, treeIndex++) {
        keys[treeIndex] = new TreeID(partition, treeIndex);

        // put the tree index in the leaf's label
        // this way we can check the stored data
        trees[treeIndex] = new Leaf(treeIndex);
      }
    }
  }
View Full Code Here

Examples of org.apache.mahout.df.node.Leaf

70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
    if (selected == null) {
      selected = new boolean[data.getDataset().nbAttributes()];
    }
   
    if (data.isEmpty()) {
      return new Leaf(-1);
    }
    if (isIdentical(data)) {
      return new Leaf(data.majorityLabel(rng));
    }
    if (data.identicalLabel()) {
      return new Leaf(data.get(0).getLabel());
    }
   
    int[] attributes = randomAttributes(rng, selected, m);
    if (attributes == null || attributes.length == 0) {
      // we tried all the attributes and could not split the data anymore
      return new Leaf(data.majorityLabel(rng));
    }

    // find the best split
    Split best = null;
    for (int attr : attributes) {
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.