Package gov.nih.mipav.model.algorithms

Class StochasticForests.TreeRegression

java.lang.Object

gov.nih.mipav.model.algorithms.StochasticForests.Tree

gov.nih.mipav.model.algorithms.StochasticForests.TreeRegression

Enclosing class:

StochasticForests

private class StochasticForests.TreeRegression
extends StochasticForests.Tree

Field Summary

Fields

Modifier and Type	Field	Description
private int[]	counter
private double[]	sums

Fields inherited from class gov.nih.mipav.model.algorithms.StochasticForests.Tree

alpha, case_weights, child_nodeIDs, data, dependent_varID, deterministic_varIDs, holdout, importance_mode, inbag_counts, keep_inbag, memory_saving_splitting, min_node_size, minprop, mtry, num_random_splits, num_samples, num_samples_oob, oob_sampleIDs, prediction_terminal_nodeIDs, random, sample_fraction, sample_with_replacement, sampleIDs, split_select_varIDs, split_select_weights, split_values, split_varIDs, splitrule, variable_importance

Constructor Summary

Constructors

Constructor	Description
TreeRegression()
TreeRegression(java.util.Vector<java.util.Vector<java.lang.Integer>> child_nodeIDs, java.util.Vector<java.lang.Integer> split_varIDs, java.util.Vector<java.lang.Double> split_values)

Method Summary

Modifier and Type	Method	Description
void	addImpurityImportance(int nodeID, int varID, double decrease)
void	allocateMemory()
void	appendToFileInternal(java.io.BufferedWriter bw)
void	bootstrapClassWise()
void	bootstrapWithoutReplacementClassWise()
void	cleanUpInternal()
double	computePredictionAccuracyInternal()
void	createEmptyNodeInternal()
double	estimate(int nodeID)
boolean	findBestSplit(int nodeID, java.util.Vector<java.lang.Integer> possible_split_varIDs)
boolean	findBestSplitExtraTrees(int nodeID, java.util.Vector<java.lang.Integer> possible_split_varIDs)
boolean	findBestSplitMaxstat(int nodeID, java.util.Vector<java.lang.Integer> possible_split_varIDs)
void	findBestSplitValueExtraTrees(int nodeID, int varID, double sum_node, int num_samples_node, double[] best_value, int[] best_varID, double[] best_decrease)
void	findBestSplitValueExtraTreesUnordered(int nodeID, int varID, double sum_node, int num_samples_node, double[] best_value, int[] best_varID, double[] best_decrease)
void	findBestSplitValueLargeQ(int nodeID, int varID, double sum_node, int num_samples_node, double[] best_value, int[] best_varID, double[] best_decrease)
void	findBestSplitValueSmallQ(int nodeID, int varID, double sum_node, int num_samples_node, double[] best_value, int[] best_varID, double[] best_decrease)
void	findBestSplitValueUnordered(int nodeID, int varID, double sum_node, int num_samples_node, double[] best_value, int[] best_varID, double[] best_decrease)
double	getPrediction(int sampleID)
int	getPredictionTerminalNodeID(int sampleID)
boolean	splitNodeInternal(int nodeID, java.util.Vector<java.lang.Integer> possible_split_varIDs)

Methods inherited from class gov.nih.mipav.model.algorithms.StochasticForests.Tree

appendToFile, bootstrap, bootstrapWeighted, bootstrapWithoutReplacement, bootstrapWithoutReplacementWeighted, computePermutationImportance, createEmptyNode, createPossibleSplitVarSubset, dispose, dropDownSamplePermuted, getChildNodeIDs, getInbagCounts, getNumSamplesOob, getOobSampleIDs, getSplitValues, getSplitVarIDs, grow, init, permuteAndPredictOobSamples, predict, splitNode

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

counter

private int[] counter

sums

private double[] sums

Constructor Detail

TreeRegression

public TreeRegression()

TreeRegression

public TreeRegression(java.util.Vector<java.util.Vector<java.lang.Integer>> child_nodeIDs,
                      java.util.Vector<java.lang.Integer> split_varIDs,
                      java.util.Vector<java.lang.Double> split_values)

Method Detail

getPredictionTerminalNodeID

public int getPredictionTerminalNodeID(int sampleID)

getPrediction

public double getPrediction(int sampleID)

allocateMemory

public void allocateMemory()

Specified by:

allocateMemory in class StochasticForests.Tree

estimate

public double estimate(int nodeID)

appendToFileInternal

public void appendToFileInternal(java.io.BufferedWriter bw)

Specified by:

appendToFileInternal in class StochasticForests.Tree

splitNodeInternal

public boolean splitNodeInternal(int nodeID,
                                 java.util.Vector<java.lang.Integer> possible_split_varIDs)

Specified by:

splitNodeInternal in class StochasticForests.Tree

createEmptyNodeInternal

public void createEmptyNodeInternal()

Specified by:

createEmptyNodeInternal in class StochasticForests.Tree

computePredictionAccuracyInternal

public double computePredictionAccuracyInternal()

Specified by:

computePredictionAccuracyInternal in class StochasticForests.Tree

findBestSplit

public boolean findBestSplit(int nodeID,
                             java.util.Vector<java.lang.Integer> possible_split_varIDs)

findBestSplitValueSmallQ

public void findBestSplitValueSmallQ(int nodeID,
                                     int varID,
                                     double sum_node,
                                     int num_samples_node,
                                     double[] best_value,
                                     int[] best_varID,
                                     double[] best_decrease)

findBestSplitValueLargeQ

public void findBestSplitValueLargeQ(int nodeID,
                                     int varID,
                                     double sum_node,
                                     int num_samples_node,
                                     double[] best_value,
                                     int[] best_varID,
                                     double[] best_decrease)

findBestSplitValueUnordered

public void findBestSplitValueUnordered(int nodeID,
                                        int varID,
                                        double sum_node,
                                        int num_samples_node,
                                        double[] best_value,
                                        int[] best_varID,
                                        double[] best_decrease)

findBestSplitMaxstat

public boolean findBestSplitMaxstat(int nodeID,
                                    java.util.Vector<java.lang.Integer> possible_split_varIDs)

findBestSplitExtraTrees

public boolean findBestSplitExtraTrees(int nodeID,
                                       java.util.Vector<java.lang.Integer> possible_split_varIDs)

findBestSplitValueExtraTrees

public void findBestSplitValueExtraTrees(int nodeID,
                                         int varID,
                                         double sum_node,
                                         int num_samples_node,
                                         double[] best_value,
                                         int[] best_varID,
                                         double[] best_decrease)

findBestSplitValueExtraTreesUnordered

public void findBestSplitValueExtraTreesUnordered(int nodeID,
                                                  int varID,
                                                  double sum_node,
                                                  int num_samples_node,
                                                  double[] best_value,
                                                  int[] best_varID,
                                                  double[] best_decrease)

addImpurityImportance

public void addImpurityImportance(int nodeID,
                                  int varID,
                                  double decrease)

bootstrapClassWise

public void bootstrapClassWise()

Specified by:

bootstrapClassWise in class StochasticForests.Tree

bootstrapWithoutReplacementClassWise

public void bootstrapWithoutReplacementClassWise()

Specified by:

bootstrapWithoutReplacementClassWise in class StochasticForests.Tree

cleanUpInternal

public void cleanUpInternal()

Specified by:

cleanUpInternal in class StochasticForests.Tree