Package weka.core

Examples of weka.core.Instances.instance()

116
117
118
119
120
121
122
123
124
125
126
    Instances result = useFilter();
    assertEquals(m_Instances.numAttributes(), result.numAttributes());
    assertTrue(result.numInstances() > 0);
    for (int i = 0; i < result.numInstances(); i++) {
      assertTrue("Should select only instances with missing values",
             result.instance(i).isMissing(4));
    }
  }
 
  /**
   * filter cannot be used in conjunction with the FilteredClassifier, since
View Full Code Here
403
404
405
406
407
408
409
410
411
412
413
      notifyTrainingSetAvailable(tse);
      // fill in predicted values
            for (int i = 0; i < trainSet.numInstances(); i++) {
              double predClass =
          classifier.classifyInstance(trainSet.instance(i));
              newTrainingSetInstances.instance(i).setValue(newTrainingSetInstances.numAttributes()-1,
            predClass);
            }
            tse = new TrainingSetEvent(this,
          newTrainingSetInstances);
            tse.m_setNumber = setNum;
View Full Code Here
469
470
471
472
473
474
475
476
477
478
479
//      fill in predicted probabilities
      for (int i = 0; i < trainSet.numInstances(); i++) {
        double [] preds = classifier.
        distributionForInstance(trainSet.instance(i));
        for (int j = 0; j < trainSet.classAttribute().numValues(); j++) {
    newTrainingSetInstances.instance(i).setValue(trainSet.numAttributes()+j,
        preds[j]);
        }
      }
      tse = new TrainingSetEvent(this,
          newTrainingSetInstances);
View Full Code Here
585
586
587
588
589
590
591
592
593
594
595
         
    // fill in predicted values
    for (int i = 0; i < testSet.numInstances(); i++) {
      double predCluster =
        clusterer.clusterInstance(testSet.instance(i));
      newInstances.instance(i).setValue(newInstances.numAttributes()-1,
                predCluster);
    }
    // notify listeners
          if (m_dataSourceListeners.size() > 0) {
            notifyDataSetAvailable(new DataSetEvent(this, newInstances));
View Full Code Here
624
625
626
627
628
629
630
631
632
633
634
    // fill in predicted probabilities
    for (int i = 0; i < testSet.numInstances(); i++) {
      double [] probs = clusterer.
        distributionForInstance(testSet.instance(i));
      for (int j = 0; j < clusterer.numberOfClusters(); j++) {
        newInstances.instance(i).setValue(testSet.numAttributes()+j,
            probs[j]);
      }
    }
    // notify listeners
    notifyDataSetAvailable(new DataSetEvent(this, newInstances));
View Full Code Here
49
50
51
52
53
54
55
56
57
58
59
    assertEquals(m_Instances.numAttributes(), result.numAttributes());
    assertEquals(m_Instances.numInstances(), result.numInstances());
    boolean diff = false;
    for (int i = 0; i < m_Instances.numInstances(); i++) {
      String i1 = m_Instances.instance(i).toString();
      String i2 = result.instance(i).toString();
      if (!i1.equals(i2)) {
        diff = true;
      }
    }
    assertTrue("All instances seem to be in the same positions", diff);
View Full Code Here
50
51
52
53
54
55
56
57
58
59
60
    ((RemoveRange)m_Filter).setInvertSelection(true);
    Instances result = useFilter();
    assertEquals(m_Instances.numAttributes(), result.numAttributes());
    assertEquals(10,  result.numInstances());
    for (int i = 0; i < 10; i++) {
      assertEquals(m_Instances.instance(i).toString(), result.instance(i).toString());
    }
  }

  public static Test suite() {
    return new TestSuite(RemoveRangeTest.class);
View Full Code Here
51
52
53
54
55
56
57
58
59
60
61
    assertEquals(m_Instances.numAttributes(), result.numAttributes());
    assertEquals(m_Instances.numInstances(),  result.numInstances());
    // Check conversion is OK
    for (int i = 0; i < result.numInstances(); i++) {
      assertTrue("Instance should not be an instanceof SparseInstance:" + (i + 1),
             !(result.instance(i) instanceof SparseInstance));
    }
  }


  public static Test suite() {
View Full Code Here
65
66
67
68
69
70
71
72
73
74
75
    assertEquals(m_Instances.numAttributes(), result.numAttributes());
    // at least one instance must be different
    boolean equal = true;
    for (int i = 0; i < m_Instances.numInstances(); i++) {
      if (m_Comparator.compare(
            m_Instances.instance(i), result.instance(i)) != 0) {
        equal = false;
        break;
      }
    }
    if (equal)
View Full Code Here
930
931
932
933
934
935
936
937
938
939
940
  if (getPerformPrediction())
    tmpInst = toInstances(getOutputFormat(), T, T.times(m_PLS1_b_hat));
  else
    tmpInst = toInstances(getOutputFormat(), T, getY(tmpInst));
 
  result.add(tmpInst.instance(0));
      }
    }
   
    return result;
  }
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
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.