Examples of weka.core.Instance.copy()

weka.core.Instance.copy()
Produces a shallow copy of this instance. The copy has access to the same dataset. (if you want to make a copy that doesn't have access to the dataset, use new Instance(instance) @return the shallow copy

    int subset;
    for (int i = 0; i < trainInstances.numInstances(); i++) {
      instance = trainInstances.instance(i);
      subset = m_c45S.whichSubset(instance);
      if (subset > -1) {
  trainingSets[subset].add((Instance)instance.copy());
      } else {
  double [] weights = m_c45S.weights(instance);
  for (int j = 0; j < m_complexityIndex; j++) {
    try {
      Instance temp = (Instance) instance.copy();

View Full Code Here

    // populate the subsets
    for (int i = 0; i < trainInstances.numInstances(); i++) {
      Instance instance = trainInstances.instance(i);
      subset = m_c45S.whichSubset(instance);
      if (subset != -1) {
  trainingSets[subset].add((Instance)instance.copy());
      } else {
  double [] weights = m_c45S.weights(instance);
  for (int j = 0; j < m_complexityIndex; j++) {
    Instance temp = (Instance)instance.copy();
    if (weights.length == m_complexityIndex) {

View Full Code Here

          classes[i] = new Instances(predictedI, 0);
          classes[i].setRelationName(predictedI.classAttribute().value(i));
        }
        for (int i = 0; i < predictedI.numInstances(); i++) {
          Instance current = predictedI.instance(i);
          classes[(int)current.classValue()].add((Instance)current.copy());
        }
        for (int i = 0; i < classes.length; i++) {
          m_offscreenPlotData.add(classes[i]);
        }
      } else {

View Full Code Here

      if(dist > maxDist) {
        maxDist = dist; furthest1 = temp;
      }
    }
    maxDist = Double.NEGATIVE_INFINITY;
    furthest1 = (Instance)furthest1.copy();
    for(int i=0; i < node.m_NumInstances; i++) {
      temp = m_Instances.instance(m_Instlist[i+node.m_Start]);
      distList[i] = m_DistanceFunction.distance(furthest1, temp, 
                                                Double.POSITIVE_INFINITY);
      if(distList[i] > maxDist) {

View Full Code Here

        }
        Instances errors = new Instances(newInsts, 0);
        int actualClass = newInsts.classIndex();
        for (int i = 0; i < newInsts.numInstances(); i++) {
          Instance current = newInsts.instance(i);
          classes[(int)current.classValue()].add((Instance)current.copy());
          
          if (current.value(actualClass) != current.value(actualClass - 1)) {
            Instance toAdd = (Instance)current.copy();
            
            // larger shape for an error

View Full Code Here

          classes[i] = new Instances(predictedI, 0);
          classes[i].setRelationName(predictedI.classAttribute().value(i));
        }
        for (int i = 0; i < predictedI.numInstances(); i++) {
          Instance current = predictedI.instance(i);
          classes[(int)current.classValue()].add((Instance)current.copy());
        }
        for (int i = 0; i < classes.length; i++) {
          m_offscreenPlotData.add(classes[i]);
        }
      } else {

View Full Code Here

      classes[i].setRelationName(insts.attribute(classIndex).value(i));
    }
    
    for (int i = 0; i < insts.numInstances(); i++) {
      Instance current = insts.instance(i);
      classes[(int)current.value(classIndex)].add((Instance)current.copy());
    }
    
    for (int i = 0; i < classes.length; i++) {
      newSeries.add(classes[i]);
    }

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.