Package weka.core

Examples of weka.core.Instance.index()


  for (int i = 0; i < inst.numValues(); i++) {
    if (!inst.isMissingSparse(i)) {
      double value = inst.valueSparse(i);
      if (inst.attributeSparse(i).isNominal()) {
        counts[inst.index(i)][(int)value] += inst.weight();
        counts[inst.index(i)][0] -= inst.weight();
      } else if (inst.attributeSparse(i).isNumeric()) {
        results[inst.index(i)] += inst.weight() * inst.valueSparse(i);
      }
    } else {
      if (inst.attributeSparse(i).isNominal()) {
View Full Code Here


      double value = inst.valueSparse(i);
      if (inst.attributeSparse(i).isNominal()) {
        counts[inst.index(i)][(int)value] += inst.weight();
        counts[inst.index(i)][0] -= inst.weight();
      } else if (inst.attributeSparse(i).isNumeric()) {
        results[inst.index(i)] += inst.weight() * inst.valueSparse(i);
      }
    } else {
      if (inst.attributeSparse(i).isNominal()) {
        counts[inst.index(i)][0] -= inst.weight();
      } else if (inst.attributeSparse(i).isNumeric()) {
View Full Code Here

      } else if (inst.attributeSparse(i).isNumeric()) {
        results[inst.index(i)] += inst.weight() * inst.valueSparse(i);
      }
    } else {
      if (inst.attributeSparse(i).isNominal()) {
        counts[inst.index(i)][0] -= inst.weight();
      } else if (inst.attributeSparse(i).isNumeric()) {
        sums[inst.index(i)] -= inst.weight();
      }
    }
  }
View Full Code Here

      }
    } else {
      if (inst.attributeSparse(i).isNominal()) {
        counts[inst.index(i)][0] -= inst.weight();
      } else if (inst.attributeSparse(i).isNumeric()) {
        sums[inst.index(i)] -= inst.weight();
      }
    }
  }
      }
      m_ModesAndMeans = new double[getInputFormat().numAttributes()];
View Full Code Here

   
    Instance temp;
    for(int i=0; i<list1.length(); i++) {
      temp = insts.instance(((ListNode)list1.get(i)).idx);
      for(int k=0; k<temp.numValues(); k++) {
        if(temp.index(k)==classIdx)
          continue;
        attrVals[k] += temp.valueSparse(k);
      }
    }
    for(int j=0; j<list2.length(); j++) {
View Full Code Here

      }
    }
    for(int j=0; j<list2.length(); j++) {
      temp = insts.instance(((ListNode)list2.get(j)).idx);
      for(int k=0; k<temp.numValues(); k++) {
        if(temp.index(k)==classIdx)
          continue;
        attrVals[k] += temp.valueSparse(k);
      }
    }
    for(int j=0, numInsts=list1.length()+list2.length();
View Full Code Here

    // Get counts
    for (int k = 0; k < numInstances; k++) {
      Instance inst = data.instance(k);
      for (int i = 0; i < inst.numValues(); i++) {
        if (inst.index(i) != classIndex) {
          if (inst.isMissingSparse(i) || inst.classIsMissing()) {
            if (!inst.isMissingSparse(i)) {
              counts[inst.index(i)][(int)inst.valueSparse(i)][numClasses] +=
                inst.weight();
              counts[inst.index(i)][0][numClasses] -= inst.weight();
View Full Code Here

      Instance inst = data.instance(k);
      for (int i = 0; i < inst.numValues(); i++) {
        if (inst.index(i) != classIndex) {
          if (inst.isMissingSparse(i) || inst.classIsMissing()) {
            if (!inst.isMissingSparse(i)) {
              counts[inst.index(i)][(int)inst.valueSparse(i)][numClasses] +=
                inst.weight();
              counts[inst.index(i)][0][numClasses] -= inst.weight();
            } else if (!inst.classIsMissing()) {
              counts[inst.index(i)][data.attribute(inst.index(i)).numValues()]
                [(int)inst.classValue()] += inst.weight();
View Full Code Here

        if (inst.index(i) != classIndex) {
          if (inst.isMissingSparse(i) || inst.classIsMissing()) {
            if (!inst.isMissingSparse(i)) {
              counts[inst.index(i)][(int)inst.valueSparse(i)][numClasses] +=
                inst.weight();
              counts[inst.index(i)][0][numClasses] -= inst.weight();
            } else if (!inst.classIsMissing()) {
              counts[inst.index(i)][data.attribute(inst.index(i)).numValues()]
                [(int)inst.classValue()] += inst.weight();
              counts[inst.index(i)][0][(int)inst.classValue()] -=
                inst.weight();
View Full Code Here

            if (!inst.isMissingSparse(i)) {
              counts[inst.index(i)][(int)inst.valueSparse(i)][numClasses] +=
                inst.weight();
              counts[inst.index(i)][0][numClasses] -= inst.weight();
            } else if (!inst.classIsMissing()) {
              counts[inst.index(i)][data.attribute(inst.index(i)).numValues()]
                [(int)inst.classValue()] += inst.weight();
              counts[inst.index(i)][0][(int)inst.classValue()] -=
                inst.weight();
            } else {
              counts[inst.index(i)][data.attribute(inst.index(i)).numValues()]
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.