weka.core.Utils.minIndex()方法的使用及代码示例

x33g5p2x  于2022-02-01 转载在 其他  
字(6.1k)|赞(0)|评价(0)|浏览(102)

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

Utils.minIndex介绍

[英]Returns index of minimum element in a given array of doubles. First minimum is returned.
[中]返回给定双精度数组中最小元素的索引。返回第一个最小值。

代码示例

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

double eval(double[] args) {
 return args[Utils.minIndex(args)];
}

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

double eval(double[] args) {
 return args[Utils.minIndex(args)];
}

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

/**
 * Convert distribution using minimum expected cost approach. The incoming
 * array is modified and returned!
 *
 * @param pred the predicted distribution
 * @param instance the instance
 * @return the modified distribution
 */
protected double[] convertDistribution(double[] pred, Instance instance) throws Exception {
 double [] costs = m_CostMatrix.expectedCosts(pred, instance);
 // This is probably not ideal
 int classIndex = Utils.minIndex(costs);
 for (int i = 0; i  < pred.length; i++) {
  if (i == classIndex) {
   pred[i] = 1.0;
  } else {
   pred[i] = 0.0;
  }
 }
 return pred;
}

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

/**
 * Convert distribution using minimum expected cost approach. The incoming
 * array is modified and returned!
 *
 * @param pred the predicted distribution
 * @param instance the instance
 * @return the modified distribution
 */
protected double[] convertDistribution(double[] pred, Instance instance) throws Exception {
 double [] costs = m_CostMatrix.expectedCosts(pred, instance);
 // This is probably not ideal
 int classIndex = Utils.minIndex(costs);
 for (int i = 0; i  < pred.length; i++) {
  if (i == classIndex) {
   pred[i] = 1.0;
  } else {
   pred[i] = 0.0;
  }
 }
 return pred;
}

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

double min = preds[Utils.minIndex(preds)];
if (min < 0) {
 for (int i = 0; i < preds.length; i++) {

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

double min = preds[Utils.minIndex(preds)];
if (min < 0) {
 for (int i = 0; i < preds.length; i++) {

代码示例来源：origin: net.sf.meka.thirdparty/mulan

finished = true;
bestCluster = Utils.minIndex(distance);

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

System.out.println("Max index (doubles): " + Utils.maxIndex(doubles));
System.out.println("Max index (ints): " + Utils.maxIndex(ints));
System.out.println("Min index (doubles): " + Utils.minIndex(doubles));
System.out.println("Min index (ints): " + Utils.minIndex(ints));
System.out.println("Median (doubles): "
 + Utils.kthSmallestValue(doubles, doubles.length / 2));

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

System.out.println("Max index (doubles): " + Utils.maxIndex(doubles));
System.out.println("Max index (ints): " + Utils.maxIndex(ints));
System.out.println("Min index (doubles): " + Utils.minIndex(doubles));
System.out.println("Min index (ints): " + Utils.minIndex(ints));
System.out.println("Median (doubles): "
 + Utils.kthSmallestValue(doubles, doubles.length / 2));

代码示例来源：origin: net.sf.meka.thirdparty/mulan

double isLabelMin = isLabelModelOuts[Utils.minIndex(isLabelModelOuts)];
double isNotLabelMax = isNotLabelModelOuts[Utils.maxIndex(isNotLabelModelOuts)];

代码示例来源：origin: net.sf.meka.thirdparty/mulan

performance[i] = Math.abs(measure.getIdealValue() - measureForThreshold[i].getValue());
int t = Utils.minIndex(performance);
if (t == 0) {
  tempThreshold = conf[j].get(t);

代码示例来源：origin: net.sf.meka.thirdparty/mulan

protected void buildInternal(MultiLabelInstances trainingData) throws Exception {
  baseLearner.build(trainingData);
  MultiLabelOutput mlo = baseLearner.makePrediction(trainingData.getDataSet().firstInstance());
  if (!mlo.hasRanking()) {
    throw new MulanRuntimeException("Learner is not a ranker");
  }
  // by default set threshold equal to the rounded average cardinality
  if (measure == null) {
    t = (int) Math.round(trainingData.getCardinality());
    t = 2;
  } else {
    // hold a reference to the trainingData in case of auto-tuning
    if (folds == 0) {
      double[] diff = computeThreshold(baseLearner, trainingData, measure);
      t = Utils.minIndex(diff);
    } else {
      autoTuneThreshold(trainingData, measure, folds);
    }
  }
}

代码示例来源：origin: net.sf.meka.thirdparty/mulan

/**
 * Automatically selects a threshold based on training set performance
 * evaluated using cross-validation
 *
 * @param measure performance is evaluated based on this parameter
 * @param folds number of cross-validation folds
 * @throws InvalidDataFormatException
 * @throws Exception
 */
private void autoTuneThreshold(MultiLabelInstances trainingData, BipartitionMeasureBase measure, int folds) throws InvalidDataFormatException, Exception {
  if (folds < 2) {
    throw new IllegalArgumentException("folds should be more than 1");
  }
  double[] totalDiff = new double[numLabels + 1];
  LabelsMetaData labelsMetaData = trainingData.getLabelsMetaData();
  MultiLabelLearner tempLearner = foldLearner.makeCopy();
  for (int f = 0; f < folds; f++) {
    Instances train = trainingData.getDataSet().trainCV(folds, f);
    MultiLabelInstances trainMulti = new MultiLabelInstances(train, labelsMetaData);
    Instances test = trainingData.getDataSet().testCV(folds, f);
    MultiLabelInstances testMulti = new MultiLabelInstances(test, labelsMetaData);
    tempLearner.build(trainMulti);
    double[] diff = computeThreshold(tempLearner, testMulti, measure);
    for (int k = 0; k < diff.length; k++) {
      totalDiff[k] += diff[k];
    }
  }
  t = Utils.minIndex(totalDiff);
}

代码示例来源：origin: net.sf.meka.thirdparty/mulan

return min + Utils.minIndex(performance) * step;

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

int pos = Utils.minIndex(kullback);
predict[(int) m_Class[pos]] += m_Weights[pos];
kullback[pos] = Double.POSITIVE_INFINITY;

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

if (this.adwin.getEstimation() > ErrEstim) {
    int index = Utils.minIndex(accuracies);
    if (getDebug())
      System.out.println("------- CHANGE DETECTED / Reset Model #"+index+" ------- ");

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

int pos = Utils.minIndex(vDist);
minValDists[k] = vDist[pos];
vDist[pos] = Double.POSITIVE_INFINITY;
pos = Utils.minIndex(nDist);
minNoiDists[k] = nDist[pos];
nDist[pos] = Double.POSITIVE_INFINITY;

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

int minI = Utils.minIndex(preds);
preds = new double[preds.length];
preds[minI] = 1.0;

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

int minI = Utils.minIndex(preds);
preds = new double[preds.length];
preds[minI] = 1.0;

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

int index = Utils.minIndex(dists);
pred[(int) m_Class[index]]++;
dists[index] = Double.POSITIVE_INFINITY;

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

Utils

相关文章

    查看更多

    热门标签

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

    最新文章

    更多

    Utils类方法

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