public DecisionForest build(int nbTrees) { List<Node> trees = Lists.newArrayList(); for (int treeId = 0; treeId < nbTrees; treeId++) { trees.add(bagging.build(rng)); logProgress(((float) treeId + 1) / nbTrees); } return new DecisionForest(trees); }
public DecisionForest build(int nbTrees) { List<Node> trees = new ArrayList<>(); for (int treeId = 0; treeId < nbTrees; treeId++) { trees.add(bagging.build(rng)); logProgress(((float) treeId + 1) / nbTrees); } return new DecisionForest(trees); }
public DecisionForest build(int nbTrees) { List<Node> trees = Lists.newArrayList(); for (int treeId = 0; treeId < nbTrees; treeId++) { trees.add(bagging.build(rng)); logProgress(((float) treeId + 1) / nbTrees); } return new DecisionForest(trees); }