private static Classifier buildClassifier(final List<TreeNode> tree) { return buildClassifier(tree, tree.get(0)); }
private static Classifier buildClassifier(final List<TreeNode> tree) { return buildClassifier(tree, tree.get(0)); }
private static Classifier[] buildClassifiers(final List<List<TreeNode>> trees) { final Classifier[] classifiers = new Classifier[trees.size()]; for (int i = 0; i < classifiers.length; i++) { classifiers[i] = buildClassifier(trees.get(i)); } return classifiers; }
private static Classifier[] buildClassifiers(final List<List<TreeNode>> trees) { final Classifier[] classifiers = new Classifier[trees.size()]; for (int i = 0; i < classifiers.length; i++) { classifiers[i] = buildClassifier(trees.get(i)); } return classifiers; }
private static Classifier buildClassifier(final List<TreeNode> tree, TreeNode current) { final HaarFeatureClassifier fc = new HaarFeatureClassifier(current.feature, current.threshold, null, null); if (current.left_node == -1) { fc.left = new ValueClassifier(current.left_val); } else { fc.left = buildClassifier(tree, tree.get(current.left_node)); } if (current.right_node == -1) { fc.right = new ValueClassifier(current.right_val); } else { fc.right = buildClassifier(tree, tree.get(current.right_node)); } return fc; }
private static Classifier buildClassifier(final List<TreeNode> tree, TreeNode current) { final HaarFeatureClassifier fc = new HaarFeatureClassifier(current.feature, current.threshold, null, null); if (current.left_node == -1) { fc.left = new ValueClassifier(current.left_val); } else { fc.left = buildClassifier(tree, tree.get(current.left_node)); } if (current.right_node == -1) { fc.right = new ValueClassifier(current.right_val); } else { fc.right = buildClassifier(tree, tree.get(current.right_node)); } return fc; }