Examples of weka.core.FastVector.elementAt()

weka.core.FastVector.elementAt()
Returns the element at the given position. @param index the element's index @return the element with the given index

  modelError.addElement(new Double(error));
      }


      if (BestFirstElements.size()!=0) {
  FastVector nextSplitElement = (FastVector)BestFirstElements.elementAt(0);
  BFTree nextSplitNode = (BFTree)nextSplitElement.elementAt(0);
  nextSplitNode.makeTree(BestFirstElements, root, train, test, modelError,
      nextSplitNode.m_SortedIndices, nextSplitNode.m_Weights,
      nextSplitNode.m_Dists, nextSplitNode.m_ClassProbs,
      nextSplitNode.m_TotalWeight, nextSplitNode.m_Props, minNumObj,
      useHeuristic, useGini,useErrorRate);

View Full Code Here

      FastVector splitInfo = m_Successors[i].computeSplitInfo(m_Successors[i], data,
    subsetSortedIndices[i], subsetWeights[i], subDists, props,
    totalSubsetWeights, useHeuristic, useGini);


      // branch proportion for this successor node
      int splitIndex = ((Attribute)splitInfo.elementAt(1)).index();
      m_Successors[i].m_Props = new double[2];
      System.arraycopy(props[splitIndex], 0, m_Successors[i].m_Props, 0,
    m_Successors[i].m_Props.length);


      // sorted indices and weights of each attribute for this successor node

View Full Code Here

      // insert this successor node into BestFirstElements according to gini gain or information gain
      //  descendingly
      if (BestFirstElements.size()==0) {
  BestFirstElements.addElement(splitInfo);
      } else {
  double gGain = ((Double)(splitInfo.elementAt(3))).doubleValue();
  int vectorSize = BestFirstElements.size();
  FastVector lastNode = (FastVector)BestFirstElements.elementAt(vectorSize-1);


  // If gini gain is less than that of last node in FastVector
  if (gGain<((Double)(lastNode.elementAt(3))).doubleValue()) {

View Full Code Here

  double gGain = ((Double)(splitInfo.elementAt(3))).doubleValue();
  int vectorSize = BestFirstElements.size();
  FastVector lastNode = (FastVector)BestFirstElements.elementAt(vectorSize-1);


  // If gini gain is less than that of last node in FastVector
  if (gGain<((Double)(lastNode.elementAt(3))).doubleValue()) {
    BestFirstElements.insertElementAt(splitInfo, vectorSize);
  } else {
    for (int j=0; j<vectorSize; j++) {
      FastVector node = (FastVector)BestFirstElements.elementAt(j);
      double nodeGain = ((Double)(node.elementAt(3))).doubleValue();

View Full Code Here

  if (gGain<((Double)(lastNode.elementAt(3))).doubleValue()) {
    BestFirstElements.insertElementAt(splitInfo, vectorSize);
  } else {
    for (int j=0; j<vectorSize; j++) {
      FastVector node = (FastVector)BestFirstElements.elementAt(j);
      double nodeGain = ((Double)(node.elementAt(3))).doubleValue();
      if (gGain>=nodeGain) {
        BestFirstElements.insertElementAt(splitInfo, j);
        break;
      }
    }

View Full Code Here

      b[1][t] = Double.NaN;
    }


    // Largest Positive exemplar
    for(int s=0; s<maxSzIdx.size(); s++){
      int exIdx = ((Integer)maxSzIdx.elementAt(s)).intValue();
      for(int p=0; p<m_Data[exIdx][0].length; p++){
        for (int q=0; q < nR;q++){
          x[2*q] = m_Data[exIdx][q][p];  // pick one instance
          x[2*q+1] = 1.0;
        }

View Full Code Here

      }
    }
    if (measureNames.size() > 0) {
      m_AdditionalMeasures = new String [measureNames.size()];
      for (int i=0;i<measureNames.size();i++) {
  m_AdditionalMeasures[i] = (String)measureNames.elementAt(i);
      }
    }
  }

View Full Code Here

    NodeList nodelist = doc.getElementsByTagName("DEFINITION");
    for (int iNode = 0; iNode < nodelist.getLength(); iNode++) {
      Node node = nodelist.item(iNode);
      FastVector list = selectElements(node, "FOR");
      if (list.size() > 0) {
        Node forNode = (Node) list.elementAt(0);
        if (getContent((Element) forNode).trim().equals(sName)) {
          return (Element) node;
        }
      }
    }

View Full Code Here

      // Get the name of the network
      nodelist2 = selectElements(nodelist.item(iNode), "NAME");
      if (nodelist2.size() == 0) {
        throw new Exception("No name specified for variable");
      }
      String sBaseName = ((CharacterData) (((Node) nodelist2.elementAt(0)).getFirstChild())).getData();
      sBaseNames.addElement(sBaseName);
      String sNodeName = sBaseName;
      if (getNode2(sNodeName) >= 0) {
        sNodeName = "Copy of " + sBaseName;
      }

View Full Code Here


      // get the parents for this node
      // resolve structure
      nodelist2 = selectElements(definition, "GIVEN");
      for (int iParent = 0; iParent < nodelist2.size(); iParent++) {
        Node parentName = ((Node) nodelist2.elementAt(iParent)).getFirstChild();
        String sParentName = ((CharacterData) (parentName)).getData();
        int nParent = -1;
        for (int iBase = 0; iBase < sBaseNames.size(); iBase++) {
          if (sParentName.equals((String) sBaseNames.elementAt(iBase))) {
            nParent = nBase + iBase;

View Full Code Here

0 1 2 3 4 5 6 7 8 9

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.