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
-
Field Summary
FieldsFields 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 -
Method Summary
Modifier and TypeMethodDescriptionvoidaddImpurityImportance(int nodeID, int varID, double decrease) voidvoidvoidvoidvoiddoublevoiddoubleestimate(int nodeID) booleanfindBestSplit(int nodeID, Vector<Integer> possible_split_varIDs) booleanfindBestSplitExtraTrees(int nodeID, Vector<Integer> possible_split_varIDs) booleanfindBestSplitMaxstat(int nodeID, Vector<Integer> possible_split_varIDs) voidfindBestSplitValueExtraTrees(int nodeID, int varID, double sum_node, int num_samples_node, double[] best_value, int[] best_varID, double[] best_decrease) voidfindBestSplitValueExtraTreesUnordered(int nodeID, int varID, double sum_node, int num_samples_node, double[] best_value, int[] best_varID, double[] best_decrease) voidfindBestSplitValueLargeQ(int nodeID, int varID, double sum_node, int num_samples_node, double[] best_value, int[] best_varID, double[] best_decrease) voidfindBestSplitValueSmallQ(int nodeID, int varID, double sum_node, int num_samples_node, double[] best_value, int[] best_varID, double[] best_decrease) voidfindBestSplitValueUnordered(int nodeID, int varID, double sum_node, int num_samples_node, double[] best_value, int[] best_varID, double[] best_decrease) doublegetPrediction(int sampleID) intgetPredictionTerminalNodeID(int sampleID) booleansplitNodeInternal(int nodeID, Vector<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
-
Field Details
-
counter
private int[] counter -
sums
private double[] sums
-
-
Constructor Details
-
TreeRegression
public TreeRegression() -
TreeRegression
-
-
Method Details
-
getPredictionTerminalNodeID
public int getPredictionTerminalNodeID(int sampleID) -
getPrediction
public double getPrediction(int sampleID) -
allocateMemory
public void allocateMemory()- Specified by:
allocateMemoryin classStochasticForests.Tree
-
estimate
public double estimate(int nodeID) -
appendToFileInternal
- Specified by:
appendToFileInternalin classStochasticForests.Tree
-
splitNodeInternal
- Specified by:
splitNodeInternalin classStochasticForests.Tree
-
createEmptyNodeInternal
public void createEmptyNodeInternal()- Specified by:
createEmptyNodeInternalin classStochasticForests.Tree
-
computePredictionAccuracyInternal
public double computePredictionAccuracyInternal()- Specified by:
computePredictionAccuracyInternalin classStochasticForests.Tree
-
findBestSplit
-
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
-
findBestSplitExtraTrees
-
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:
bootstrapClassWisein classStochasticForests.Tree
-
bootstrapWithoutReplacementClassWise
public void bootstrapWithoutReplacementClassWise()- Specified by:
bootstrapWithoutReplacementClassWisein classStochasticForests.Tree
-
cleanUpInternal
public void cleanUpInternal()- Specified by:
cleanUpInternalin classStochasticForests.Tree
-