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 Details

    • counter

      private int[] counter
    • sums

      private double[] sums
  • Constructor Details

  • Method Details

    • 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(BufferedWriter bw)
      Specified by:
      appendToFileInternal in class StochasticForests.Tree
    • splitNodeInternal

      public boolean splitNodeInternal(int nodeID, Vector<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, Vector<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, Vector<Integer> possible_split_varIDs)
    • findBestSplitExtraTrees

      public boolean findBestSplitExtraTrees(int nodeID, Vector<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