List of instancesDownBranch() Examples

Examples of instancesDownBranch()

weka.classifiers.trees.adtree.Splitter.instancesDownBranch()
Gets the subset of instances that apply to a particluar branch of the split. If the branch index is -1, the subset will consist of those instances that don't apply to any branch. @param branch the index of the branch @param sourceInstances the instances from which to find the subset @return the set of instances that apply

Examples of weka.classifiers.trees.adtree.Splitter.instancesDownBranch()


    for (Enumeration e = currentNode.children(); e.hasMoreElements(); ) {
      Splitter split = (Splitter) e.nextElement();
      for (int i=0; i<split.getNumOfBranches(); i++)
  searchForBestTestSingle(split.getChildForBranch(i),
        split.instancesDownBranch(i, posInstances),
        split.instancesDownBranch(i, negInstances));
    }
  }


  /**

View Full Code Here

Examples of weka.classifiers.trees.adtree.Splitter.instancesDownBranch()

    for (Enumeration e = currentNode.children(); e.hasMoreElements(); ) {
      Splitter split = (Splitter) e.nextElement();
      for (int i=0; i<split.getNumOfBranches(); i++)
  searchForBestTestSingle(split.getChildForBranch(i),
        split.instancesDownBranch(i, posInstances),
        split.instancesDownBranch(i, negInstances));
    }
  }


  /**
   * Continues single (two-class optimized) search by investigating only the path

View Full Code Here

Examples of weka.classifiers.trees.adtree.Splitter.instancesDownBranch()

    double largestWeight = 0.0;
    for (Enumeration e = currentNode.children(); e.hasMoreElements(); ) {
      Splitter split = (Splitter) e.nextElement();
      for (int i=0; i<split.getNumOfBranches(); i++) {
  double weight =
    split.instancesDownBranch(i, posInstances).sumOfWeights() +
    split.instancesDownBranch(i, negInstances).sumOfWeights();
  if (weight > largestWeight) {
    heaviestSplit = split;
    heaviestBranch = i;
    largestWeight = weight;

View Full Code Here

Examples of weka.classifiers.trees.adtree.Splitter.instancesDownBranch()

    for (Enumeration e = currentNode.children(); e.hasMoreElements(); ) {
      Splitter split = (Splitter) e.nextElement();
      for (int i=0; i<split.getNumOfBranches(); i++) {
  double weight =
    split.instancesDownBranch(i, posInstances).sumOfWeights() +
    split.instancesDownBranch(i, negInstances).sumOfWeights();
  if (weight > largestWeight) {
    heaviestSplit = split;
    heaviestBranch = i;
    largestWeight = weight;
  }

View Full Code Here

Examples of weka.classifiers.trees.adtree.Splitter.instancesDownBranch()


    // search for branch with lowest Z-pure
    for (Enumeration e = currentNode.children(); e.hasMoreElements(); ) {
      Splitter split = (Splitter) e.nextElement();
      for (int i=0; i<split.getNumOfBranches(); i++) {
  Instances posSplit = split.instancesDownBranch(i, posInstances);
  Instances negSplit = split.instancesDownBranch(i, negInstances);
  double newZpure = calcZpure(posSplit, negSplit);
  if (newZpure < lowestZpure) {
    lowestZpure = newZpure;
    bestPath = split.getChildForBranch(i);

View Full Code Here

Examples of weka.classifiers.trees.adtree.Splitter.instancesDownBranch()

    // search for branch with lowest Z-pure
    for (Enumeration e = currentNode.children(); e.hasMoreElements(); ) {
      Splitter split = (Splitter) e.nextElement();
      for (int i=0; i<split.getNumOfBranches(); i++) {
  Instances posSplit = split.instancesDownBranch(i, posInstances);
  Instances negSplit = split.instancesDownBranch(i, negInstances);
  double newZpure = calcZpure(posSplit, negSplit);
  if (newZpure < lowestZpure) {
    lowestZpure = newZpure;
    bestPath = split.getChildForBranch(i);
    bestPosSplit = posSplit;

View Full Code Here

Examples of weka.classifiers.trees.adtree.Splitter.instancesDownBranch()


    FastVector children = currentNode.getChildren();
    Splitter split = (Splitter) children.elementAt(getRandom(children.size()));
    int branch = getRandom(split.getNumOfBranches());
    searchForBestTestSingle(split.getChildForBranch(branch),
          split.instancesDownBranch(branch, posInstances),
          split.instancesDownBranch(branch, negInstances));
  }


  /**
   * Investigates the option of introducing a nominal split under currentNode. If it

View Full Code Here

Examples of weka.classifiers.trees.adtree.Splitter.instancesDownBranch()

    FastVector children = currentNode.getChildren();
    Splitter split = (Splitter) children.elementAt(getRandom(children.size()));
    int branch = getRandom(split.getNumOfBranches());
    searchForBestTestSingle(split.getChildForBranch(branch),
          split.instancesDownBranch(branch, posInstances),
          split.instancesDownBranch(branch, negInstances));
  }


  /**
   * Investigates the option of introducing a nominal split under currentNode. If it
   * finds a split that has a Z-value lower than has already been found it will

View Full Code Here

Examples of weka.classifiers.trees.adtree.Splitter.instancesDownBranch()

  PredictionNode child = split.getChildForBranch(i);
  if (child != null) {
    text.append("S" + split.orderAdded + "->" + "S" + split.orderAdded + "P" + i +
          " [label=\"" + split.comparisonString(i, m_trainInstances) + "\"]\n");
    graphTraverse(child, text, split.orderAdded, i,
      split.instancesDownBranch(i, instances));
  }
      }
    }  
  }

View Full Code Here

Examples of weka.classifiers.trees.adtree.Splitter.instancesDownBranch()


    for (Enumeration e = currentNode.children(); e.hasMoreElements(); ) {
      Splitter split = (Splitter) e.nextElement();
      for (int i=0; i<split.getNumOfBranches(); i++)
  searchForBestTestSingle(split.getChildForBranch(i),
        split.instancesDownBranch(i, posInstances),
        split.instancesDownBranch(i, negInstances));
    }
  }


  /**

View Full Code Here

0 1

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.