Package org.apache.mahout.df.callback

Examples of org.apache.mahout.df.callback.SingleTreePredictions

153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
    Bagging bagging = new Bagging(getTreeBuilder(), data);
   
    TreeID key = new TreeID();
   
    log.debug("Building {} trees", nbTrees);
    SingleTreePredictions callback = null;
    int[] predictions = null;
    for (int treeId = 0; treeId < nbTrees; treeId++) {
      log.debug("Building tree number : {}", treeId);
      if (isOobEstimate() && !isNoOutput()) {
        callback = new SingleTreePredictions(data.size());
        predictions = callback.getPredictions();
      }
     
      Node tree = bagging.build(treeId, rng, callback);
     
      key.set(partition, firstTreeId + treeId);
View Full Code Here
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
    map(key, context);
  }
 
  public void map(IntWritable key, Context context) throws IOException, InterruptedException {
   
    SingleTreePredictions callback = null;
    int[] predictions = null;
   
    if (isOobEstimate() && !isNoOutput()) {
      callback = new SingleTreePredictions(data.size());
      predictions = callback.getPredictions();
    }
   
    initRandom((InMemInputSplit) context.getInputSplit());
   
    log.debug("Building...");
View Full Code Here
153
154
155
156
157
158
159
160
161
    }
   
    // init the callbacks
    callbacks = new SingleTreePredictions[nbConcerned];
    for (int index = 0; index < nbConcerned; index++) {
      callbacks[index] = new SingleTreePredictions(numInstances);
    }
   
  }
View Full Code Here
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
    map(key, output, (InMemInputSplit) reporter.getInputSplit());
  }
 
  public void map(IntWritable key, OutputCollector<IntWritable,MapredOutput> output, InMemInputSplit split) throws IOException {
   
    SingleTreePredictions callback = null;
    int[] predictions = null;
   
    if (isOobEstimate() && !isNoOutput()) {
      callback = new SingleTreePredictions(data.size());
      predictions = callback.getPredictions();
    }
   
    initRandom(split);
   
    log.debug("Building...");
View Full Code Here
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
    Bagging bagging = new Bagging(getTreeBuilder(), data);
   
    TreeID key = new TreeID();
   
    log.debug("Building {} trees", nbTrees);
    SingleTreePredictions callback = null;
    int[] predictions = null;
    for (int treeId = 0; treeId < nbTrees; treeId++) {
      log.debug("Building tree number: {}", treeId);
      if (isOobEstimate() && !isNoOutput()) {
        callback = new SingleTreePredictions(data.size());
        predictions = callback.getPredictions();
      }
     
      Node tree = bagging.build(treeId, rng, callback);
     
      key.set(partition, firstTreeId + treeId);
View Full Code Here
173
174
175
176
177
178
179
180
181
    }
   
    // init the callbacks
    callbacks = new SingleTreePredictions[nbConcerned];
    for (int index = 0; index < nbConcerned; index++) {
      callbacks[index] = new SingleTreePredictions(numInstances);
    }
   
  }
View Full Code Here
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
    map(key, context);
  }
 
  protected void map(IntWritable key, Context context) throws IOException, InterruptedException {
   
    SingleTreePredictions callback = null;
    int[] predictions = null;
   
    if (isOobEstimate() && !isNoOutput()) {
      callback = new SingleTreePredictions(data.size());
      predictions = callback.getPredictions();
    }
   
    initRandom((InMemInputSplit) context.getInputSplit());
   
    log.debug("Building...");
View Full Code Here
142
143
144
145
146
147
148
149
150
    }
   
    // init the callbacks
    callbacks = new SingleTreePredictions[nbConcerned];
    for (int index = 0; index < nbConcerned; index++) {
      callbacks[index] = new SingleTreePredictions(numInstances);
    }
   
  }
View Full Code Here
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
    Bagging bagging = new Bagging(getTreeBuilder(), data);
   
    TreeID key = new TreeID();
   
    log.debug("Building {} trees", nbTrees);
    SingleTreePredictions callback = null;
    int[] predictions = null;
    for (int treeId = 0; treeId < nbTrees; treeId++) {
      log.debug("Building tree number : {}", treeId);
      if (isOobEstimate() && !isNoOutput()) {
        callback = new SingleTreePredictions(data.size());
        predictions = callback.getPredictions();
      }
     
      Node tree = bagging.build(treeId, rng, callback);
     
      key.set(partition, firstTreeId + treeId);
View Full Code Here
151
152
153
154
155
156
157
158
159
    }

    // init the callbacks
    callbacks = new SingleTreePredictions[nbConcerned];
    for (int index = 0; index < nbConcerned; index++) {
      callbacks[index] = new SingleTreePredictions(numInstances);
    }

  }
View Full Code Here
TOP

Related Classes of org.apache.mahout.df.callback.SingleTreePredictions

  • org.apache.mahout.df.mapred.inmem.InMemMapper
  • org.apache.mahout.df.mapred.partial.Step1Mapper
  • org.apache.mahout.df.mapred.partial.Step2Mapper
  • org.apache.mahout.df.mapreduce.inmem.InMemMapper
  • org.apache.mahout.df.mapreduce.partial.Step1Mapper
  • org.apache.mahout.df.mapreduce.partial.Step2Mapper
    • 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.