weka.core.Instance.numValues()方法的使用及代码示例

x33g5p2x  于2022-01-21 转载在 其他  
字(11.7k)|赞(0)|评价(0)|浏览(192)

本文整理了Java中weka.core.Instance.numValues()方法的一些代码示例，展示了Instance.numValues()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台，是从一些精选项目中提取出来的代码，具有较强的参考意义，能在一定程度帮忙到你。Instance.numValues()方法的具体详情如下：
包路径：weka.core.Instance
类名称：Instance
方法名：numValues

Instance.numValues介绍

[英]Returns the number of values present in a sparse representation.
[中]返回稀疏表示形式中存在的值的数目。

代码示例

代码示例来源：origin: nz.ac.waikato.cms.weka/weka-stable

/**
 * Checks if there is any missing value in the given 
 * instance.
 * @param ins The instance to check missing values in.
 * @throws Exception If there is a missing value in the 
 * instance.
 */
protected void checkMissing(Instance ins) throws Exception {
 for (int j = 0; j < ins.numValues(); j++) {
  if (ins.index(j) != ins.classIndex())
   if (ins.isMissingSparse(j)) {
    throw new Exception("ERROR: KDTree can not deal with missing "
      + "values. Please run ReplaceMissingValues filter "
      + "on the dataset before passing it on to the KDTree.");
   }
 }
}

代码示例来源：origin: Waikato/weka-trunk

/**
 * Checks if there is any missing value in the given 
 * instance.
 * @param ins The instance to check missing values in.
 * @throws Exception If there is a missing value in the 
 * instance.
 */
protected void checkMissing(Instance ins) throws Exception {
 for (int j = 0; j < ins.numValues(); j++) {
  if (ins.index(j) != ins.classIndex())
   if (ins.isMissingSparse(j)) {
    throw new Exception("ERROR: KDTree can not deal with missing "
      + "values. Please run ReplaceMissingValues filter "
      + "on the dataset before passing it on to the KDTree.");
   }
 }
}

代码示例来源：origin: nz.ac.waikato.cms.weka/SPegasos

protected static double dotProd(Instance inst1, double[] weights, int classIndex) {
 double result = 0;
 int n1 = inst1.numValues();
 int n2 = weights.length - 1; 
 for (int p1 = 0, p2 = 0; p1 < n1 && p2 < n2;) {
  int ind1 = inst1.index(p1);
  int ind2 = p2;
  if (ind1 == ind2) {
   if (ind1 != classIndex && !inst1.isMissingSparse(p1)) {
    result += inst1.valueSparse(p1) * weights[p2];
   }
   p1++;
   p2++;
  } else if (ind1 > ind2) {
   p2++;
  } else {
   p1++;
  }
 }
 return (result);
}

代码示例来源：origin: nz.ac.waikato.cms.weka/weka-stable

protected static double dotProd(Instance inst1, double[] weights,
  int classIndex) {
 double result = 0;
 int n1 = inst1.numValues();
 int n2 = weights.length - 1;
 for (int p1 = 0, p2 = 0; p1 < n1 && p2 < n2;) {
  int ind1 = inst1.index(p1);
  int ind2 = p2;
  if (ind1 == ind2) {
   if (ind1 != classIndex && !inst1.isMissingSparse(p1)) {
    result += inst1.valueSparse(p1) * weights[p2];
   }
   p1++;
   p2++;
  } else if (ind1 > ind2) {
   p2++;
  } else {
   p1++;
  }
 }
 return (result);
}

代码示例来源：origin: Waikato/weka-trunk

protected static double dotProd(Instance inst1, double[] weights,
  int classIndex) {
 double result = 0;
 int n1 = inst1.numValues();
 int n2 = weights.length - 1;
 for (int p1 = 0, p2 = 0; p1 < n1 && p2 < n2;) {
  int ind1 = inst1.index(p1);
  int ind2 = p2;
  if (ind1 == ind2) {
   if (ind1 != classIndex && !inst1.isMissingSparse(p1)) {
    result += inst1.valueSparse(p1) * weights[p2];
   }
   p1++;
   p2++;
  } else if (ind1 > ind2) {
   p2++;
  } else {
   p1++;
  }
 }
 return (result);
}

代码示例来源：origin: org.kramerlab/bmad

/**
 * Constructs dense boolean matrix from weka instances, 
 * that is expected to be filled with values 0, ?, 1
 */
public BooleanMatrix(Instances instances) {
  this(instances.numInstances(), instances.numAttributes());
  int row = 0;
  for (Instance instance: instances) {
    for (int i = 0; i < instance.numValues(); i++) {
      int col = instance.index(i);
      double value = instance.valueSparse(i);
      byte b = Double.isNaN(value) ? UNKNOWN : value == 0d ? FALSE : TRUE;
      this.update(row, col, b);
    }
    row++;
  }
}

代码示例来源：origin: nz.ac.waikato.cms.weka/weka-stable

/**
 * Checks if there is any instance with missing values. Throws an exception if
 * there is, as KDTree does not handle missing values.
 * 
 * @param instances    the instances to check
 * @throws Exception    if missing values are encountered
 */
protected void checkMissing(Instances instances) throws Exception {
 for (int i = 0; i < instances.numInstances(); i++) {
  Instance ins = instances.instance(i);
  for (int j = 0; j < ins.numValues(); j++) {
   if (ins.index(j) != ins.classIndex())
    if (ins.isMissingSparse(j)) {
     throw new Exception("ERROR: KDTree can not deal with missing "
       + "values. Please run ReplaceMissingValues filter "
       + "on the dataset before passing it on to the KDTree.");
    }
  }
 }
}

代码示例来源：origin: nz.ac.waikato.cms.weka/weka-stable

/**
 * Checks if there is any instance with missing values. Throws an exception if
 * there is, as KDTree does not handle missing values.
 * 
 * @param instances the instances to check
 * @throws Exception if missing values are encountered
 */
protected void checkMissing(Instances instances) throws Exception {
 for (int i = 0; i < instances.numInstances(); i++) {
  Instance ins = instances.instance(i);
  for (int j = 0; j < ins.numValues(); j++) {
   if (ins.index(j) != ins.classIndex()) {
    if (ins.isMissingSparse(j)) {
     throw new Exception("ERROR: KDTree can not deal with missing "
      + "values. Please run ReplaceMissingValues filter "
      + "on the dataset before passing it on to the KDTree.");
    }
   }
  }
 }
}

代码示例来源：origin: Waikato/weka-trunk

/**
 * Checks if there is any instance with missing values. Throws an exception if
 * there is, as KDTree does not handle missing values.
 * 
 * @param instances the instances to check
 * @throws Exception if missing values are encountered
 */
protected void checkMissing(Instances instances) throws Exception {
 for (int i = 0; i < instances.numInstances(); i++) {
  Instance ins = instances.instance(i);
  for (int j = 0; j < ins.numValues(); j++) {
   if (ins.index(j) != ins.classIndex()) {
    if (ins.isMissingSparse(j)) {
     throw new Exception("ERROR: KDTree can not deal with missing "
      + "values. Please run ReplaceMissingValues filter "
      + "on the dataset before passing it on to the KDTree.");
    }
   }
  }
 }
}

代码示例来源：origin: Waikato/weka-trunk

/**
 * Checks if there is any instance with missing values. Throws an exception if
 * there is, as KDTree does not handle missing values.
 * 
 * @param instances    the instances to check
 * @throws Exception    if missing values are encountered
 */
protected void checkMissing(Instances instances) throws Exception {
 for (int i = 0; i < instances.numInstances(); i++) {
  Instance ins = instances.instance(i);
  for (int j = 0; j < ins.numValues(); j++) {
   if (ins.index(j) != ins.classIndex())
    if (ins.isMissingSparse(j)) {
     throw new Exception("ERROR: KDTree can not deal with missing "
       + "values. Please run ReplaceMissingValues filter "
       + "on the dataset before passing it on to the KDTree.");
    }
  }
 }
}

代码示例来源：origin: nz.ac.waikato.cms.weka/weka-stable

/**
 * Merges this instance with the given instance and returns the result.
 * Dataset is set to null.
 * 
 * @param inst the instance to be merged with this one
 * @return the merged instances
 */
@Override
public Instance mergeInstance(Instance inst) {
 double[] values = new double[numValues() + inst.numValues()];
 int[] indices = new int[numValues() + inst.numValues()];
 int m = 0;
 for (int j = 0; j < numValues(); j++, m++) {
  values[m] = valueSparse(j);
  indices[m] = index(j);
 }
 for (int j = 0; j < inst.numValues(); j++, m++) {
  values[m] = inst.valueSparse(j);
  indices[m] = numAttributes() + inst.index(j);
 }
 return new SparseInstance(1.0, values, indices, numAttributes()
  + inst.numAttributes());
}

代码示例来源：origin: nz.ac.waikato.cms.weka/weka-stable

private void processSingleton(Instance current,
 ArrayList<BinaryItem> singletons) throws Exception {
 if (current instanceof SparseInstance) {
  for (int j = 0; j < current.numValues(); j++) {
   int attIndex = current.index(j);
   singletons.get(attIndex).increaseFrequency();
  }
 } else {
  for (int j = 0; j < current.numAttributes(); j++) {
   if (!current.isMissing(j)) {
    if (current.attribute(j).numValues() == 1
     || current.value(j) == m_positiveIndex - 1) {
     singletons.get(j).increaseFrequency();
    }
   }
  }
 }
}

代码示例来源：origin: nz.ac.waikato.cms.weka/weka-stable

/**
 * Calculates the centroid pivot of a node. The node is given
 * in the form of an indices array that contains the 
 * indices of the points inside the node.   
 * @param instList The indices array pointing to the 
 * instances in the node.
 * @param insts The actual instances. The instList
 * points to instances in this object.  
 * @return The calculated centre/pivot of the node.  
 */
public static Instance calcCentroidPivot(int[] instList, Instances insts) {
 double[] attrVals = new double[insts.numAttributes()];
 
 Instance temp;
 for(int i=0; i<instList.length; i++) {
  temp = insts.instance(instList[i]);
  for(int j=0; j<temp.numValues(); j++) {
   attrVals[j] += temp.valueSparse(j);
  }
 }
 for(int j=0, numInsts=instList.length; j<attrVals.length; j++) {
  attrVals[j] /= numInsts;
 }
 temp = new DenseInstance(1.0, attrVals);
 return temp;
}

代码示例来源：origin: Waikato/weka-trunk

private void processSingleton(Instance current,
 ArrayList<BinaryItem> singletons) throws Exception {
 if (current instanceof SparseInstance) {
  for (int j = 0; j < current.numValues(); j++) {
   int attIndex = current.index(j);
   singletons.get(attIndex).increaseFrequency();
  }
 } else {
  for (int j = 0; j < current.numAttributes(); j++) {
   if (!current.isMissing(j)) {
    if (current.attribute(j).numValues() == 1
     || current.value(j) == m_positiveIndex - 1) {
     singletons.get(j).increaseFrequency();
    }
   }
  }
 }
}

代码示例来源：origin: nz.ac.waikato.cms.weka/weka-stable

/**
 * 
 * @param inst
 * @return
 * @throws Exception
 */
public double SVMOutput(Instance inst) throws Exception {
 double result = -m_b;
 // Is the machine linear?
 if (m_weights != null) {
  // Is weight vector stored in sparse format?
  for (int i = 0; i < inst.numValues(); i++) {
   if (inst.index(i) != m_classIndex) {
    result += m_weights[inst.index(i)] * inst.valueSparse(i);
   }
  }
 } else {
  for (int i = m_supportVectors.getNext(-1); i != -1; i = m_supportVectors
   .getNext(i)) {
   result += (m_alpha[i] - m_alphaStar[i]) * m_kernel.eval(-1, i, inst);
  }
 }
 return result;
}

代码示例来源：origin: nz.ac.waikato.cms.weka/weka-stable

/**
 * Builds the kernel. Calls the super class method and then also initializes the cache for
 * the diagonal of the dot product matrix.
 */
public void buildKernel(Instances data) throws Exception {
 super.buildKernel(data);
 m_kernelPrecalc = new double[data.numInstances()];
 for (int i = 0; i < data.numInstances(); i++) {
  double sum = 0;
  Instance inst = data.instance(i);
  for (int j = 0; j < inst.numValues(); j++) {
   if (inst.index(j) != data.classIndex()) {
    sum += inst.valueSparse(j) * inst.valueSparse(j);
   }
  }
  m_kernelPrecalc[i] = sum;
 }
}

代码示例来源：origin: nz.ac.waikato.cms.weka/weka-stable

/**
 * Updates the classifier with information from one training instance.
 *
 * @param instance the instance to be incorporated
 * @throws Exception if the instance cannot be processed successfully.
 */
public void updateClassifier(Instance instance) throws Exception {
 double classValue = instance.value(instance.classIndex());
 if (!Utils.isMissingValue(classValue)) {
  int classIndex = (int) classValue;
  m_probOfClass[classIndex] += instance.weight();
  for (int a = 0; a < instance.numValues(); a++) {
   if (instance.index(a) != instance.classIndex()) {
    if (!instance.isMissingSparse(a)) {
     double numOccurrences = instance.valueSparse(a) * instance.weight();
     if (numOccurrences < 0)
      throw new Exception("Numeric attribute values must all be greater or equal to zero.");
     m_wordsPerClass[classIndex] += numOccurrences;
     m_probOfWordGivenClass[classIndex][instance.index(a)] += numOccurrences;
    }
   }
  }
 }
}

代码示例来源：origin: Waikato/weka-trunk

/**
 * Builds the kernel. Calls the super class method and then also initializes the cache for
 * the diagonal of the dot product matrix.
 */
public void buildKernel(Instances data) throws Exception {
 super.buildKernel(data);
 m_kernelPrecalc = new double[data.numInstances()];
 for (int i = 0; i < data.numInstances(); i++) {
  double sum = 0;
  Instance inst = data.instance(i);
  for (int j = 0; j < inst.numValues(); j++) {
   if (inst.index(j) != data.classIndex()) {
    sum += inst.valueSparse(j) * inst.valueSparse(j);
   }
  }
  m_kernelPrecalc[i] = sum;
 }
}

代码示例来源：origin: nz.ac.waikato.cms.weka/weka-stable

/**
 * converts a single instance to the required format
 * 
 * @param instance the instance to convert
 * @return the converted instance
 */
protected Instance convertInstance(Instance instance) throws Exception {
 double vals[] = new double[outputFormatPeek().numAttributes()];
 for (int j = 0; j < m_k; j++) {
  for (int i = 0; i < instance.numValues(); i++) {
   int index = instance.index(i);
   if (index != instance.classIndex()) {
    double value = instance.valueSparse(i);
    if (!Utils.isMissingValue(value)) {
     vals[j] += m_rmatrix[j][index] * value;
    }
   } else {
    vals[m_k] = instance.valueSparse(i);
   }
  }
 }
 return new DenseInstance(instance.weight(), vals);
}

代码示例来源：origin: Waikato/weka-trunk

/**
 * converts a single instance to the required format
 * 
 * @param instance the instance to convert
 * @return the converted instance
 */
protected Instance convertInstance(Instance instance) throws Exception {
 double vals[] = new double[outputFormatPeek().numAttributes()];
 for (int j = 0; j < m_k; j++) {
  for (int i = 0; i < instance.numValues(); i++) {
   int index = instance.index(i);
   if (index != instance.classIndex()) {
    double value = instance.valueSparse(i);
    if (!Utils.isMissingValue(value)) {
     vals[j] += m_rmatrix[j][index] * value;
    }
   } else {
    vals[m_k] = instance.valueSparse(i);
   }
  }
 }
 return new DenseInstance(instance.weight(), vals);
}

内容来源于网络，如有侵权，请联系作者删除！

Instance

相关文章

    查看更多

    热门标签

    更多
    JavaquerypythonNode开发语言requestUtil数据库Table后端算法LoggerMessageElementParser

    最新文章

    更多

    Instance类方法

    • 蜀ICP备13028337号-1 大数据知识库 https://www.saoniuhuo.com © All rights reserved
    • 本站内容来源互联网,如果侵犯您的权益请联系我们删除, 联系方式：448109455@qq.com