de.lmu.ifi.dbs.elki.logging.Logging.isVerbose()方法的使用及代码示例

x33g5p2x  于2022-01-23 转载在 其他  
字(10.1k)|赞(0)|评价(0)|浏览(129)

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

Logging.isVerbose介绍

[英]Test whether to log 'verbose' aka 'info'.
[中]测试是否记录'verbose'或'info'。

代码示例

代码示例来源：origin: elki-project/elki

@Override
 public void print(String arg0) {
  if(LOG.isVerbose()) {
   LOG.verbose(arg0);
  }
 }
};

代码示例来源：origin: elki-project/elki

@Override
public void processNewResult(ResultHierarchy hier, Result newResult) {
 if(LOG.isVerbose()) {
  StringBuilder buf = new StringBuilder();
  recursiveLogResult(buf, hier, newResult, 0);
  LOG.verbose(buf.toString());
 }
}

代码示例来源：origin: de.lmu.ifi.dbs.elki/elki

@Override
public void processNewResult(ResultHierarchy hier, Result newResult) {
 if(LOG.isVerbose()) {
  StringBuilder buf = new StringBuilder();
  recursiveLogResult(buf, hier, newResult, 0);
  LOG.verbose(buf.toString());
 }
}

代码示例来源：origin: elki-project/elki

@Override
public void initialize() {
 bulkLoad(relation.getDBIDs());
 if(LOG.isVerbose()) {
  int[] counts = new int[5];
  checkCoverTree(root, counts, 0);
  LOG.statistics(new LongStatistic(this.getClass().getName() + ".nodes", counts[0]));
  LOG.statistics(new DoubleStatistic(this.getClass().getName() + ".avg-depth", counts[1] / (double) counts[0]));
  LOG.statistics(new LongStatistic(this.getClass().getName() + ".max-depth", counts[2]));
  LOG.statistics(new LongStatistic(this.getClass().getName() + ".singletons", counts[3]));
  LOG.statistics(new LongStatistic(this.getClass().getName() + ".entries", counts[4]));
 }
}

代码示例来源：origin: elki-project/elki

@Override
public void initialize() {
 bulkLoad(relation.getDBIDs());
 if(LOG.isVerbose()) {
  int[] counts = new int[5];
  checkCoverTree(root, counts, 0);
  LOG.statistics(new LongStatistic(this.getClass().getName() + ".nodes", counts[0]));
  LOG.statistics(new DoubleStatistic(this.getClass().getName() + ".avg-depth", counts[1] / (double) counts[0]));
  LOG.statistics(new LongStatistic(this.getClass().getName() + ".max-depth", counts[2]));
  LOG.statistics(new LongStatistic(this.getClass().getName() + ".singletons", counts[3]));
  LOG.statistics(new LongStatistic(this.getClass().getName() + ".entries", counts[4]));
 }
}

代码示例来源：origin: de.lmu.ifi.dbs.elki/elki

@Override
public void initialize() {
 bulkLoad(relation.getDBIDs());
 if(LOG.isVerbose()) {
  int[] counts = new int[5];
  checkCoverTree(root, counts, 0);
  LOG.statistics(new LongStatistic(this.getClass().getName() + ".nodes", counts[0]));
  LOG.statistics(new DoubleStatistic(this.getClass().getName() + ".avg-depth", counts[1] / (double) counts[0]));
  LOG.statistics(new LongStatistic(this.getClass().getName() + ".max-depth", counts[2]));
  LOG.statistics(new LongStatistic(this.getClass().getName() + ".singletons", counts[3]));
  LOG.statistics(new LongStatistic(this.getClass().getName() + ".entries", counts[4]));
 }
}

代码示例来源：origin: de.lmu.ifi.dbs.elki/elki

@Override
public void initialize() {
 bulkLoad(relation.getDBIDs());
 if(LOG.isVerbose()) {
  int[] counts = new int[5];
  checkCoverTree(root, counts, 0);
  LOG.statistics(new LongStatistic(this.getClass().getName() + ".nodes", counts[0]));
  LOG.statistics(new DoubleStatistic(this.getClass().getName() + ".avg-depth", counts[1] / (double) counts[0]));
  LOG.statistics(new LongStatistic(this.getClass().getName() + ".max-depth", counts[2]));
  LOG.statistics(new LongStatistic(this.getClass().getName() + ".singletons", counts[3]));
  LOG.statistics(new LongStatistic(this.getClass().getName() + ".entries", counts[4]));
 }
}

代码示例来源：origin: de.lmu.ifi.dbs.elki/elki-index-various

@Override
public void initialize() {
 bulkLoad(relation.getDBIDs());
 if(LOG.isVerbose()) {
  int[] counts = new int[5];
  checkCoverTree(root, counts, 0);
  LOG.statistics(new LongStatistic(this.getClass().getName() + ".nodes", counts[0]));
  LOG.statistics(new DoubleStatistic(this.getClass().getName() + ".avg-depth", counts[1] / (double) counts[0]));
  LOG.statistics(new LongStatistic(this.getClass().getName() + ".max-depth", counts[2]));
  LOG.statistics(new LongStatistic(this.getClass().getName() + ".singletons", counts[3]));
  LOG.statistics(new LongStatistic(this.getClass().getName() + ".entries", counts[4]));
 }
}

代码示例来源：origin: de.lmu.ifi.dbs.elki/elki-index-various

@Override
public void initialize() {
 bulkLoad(relation.getDBIDs());
 if(LOG.isVerbose()) {
  int[] counts = new int[5];
  checkCoverTree(root, counts, 0);
  LOG.statistics(new LongStatistic(this.getClass().getName() + ".nodes", counts[0]));
  LOG.statistics(new DoubleStatistic(this.getClass().getName() + ".avg-depth", counts[1] / (double) counts[0]));
  LOG.statistics(new LongStatistic(this.getClass().getName() + ".max-depth", counts[2]));
  LOG.statistics(new LongStatistic(this.getClass().getName() + ".singletons", counts[3]));
  LOG.statistics(new LongStatistic(this.getClass().getName() + ".entries", counts[4]));
 }
}

代码示例来源：origin: elki-project/elki

public Clustering<OPTICSModel> run(Database database, Relation<?> relation) {
 // TODO: ensure we are using the same relation?
 ClusterOrder opticsresult = optics.run(database);
 if(LOG.isVerbose()) {
  LOG.verbose("Extracting clusters with Xi: " + xi);
 }
 return extractClusters(opticsresult, relation, 1.0 - xi, optics.getMinPts());
}

代码示例来源：origin: de.lmu.ifi.dbs.elki/elki

public Clustering<OPTICSModel> run(Database database, Relation<?> relation) {
 // TODO: ensure we are using the same relation?
 ClusterOrder opticsresult = optics.run(database);
 if(LOG.isVerbose()) {
  LOG.verbose("Extracting clusters with Xi: " + xi);
 }
 return extractClusters(opticsresult, relation, 1.0 - xi, optics.getMinPts());
}

代码示例来源：origin: de.lmu.ifi.dbs.elki/elki-clustering

public Clustering<OPTICSModel> run(Database database, Relation<?> relation) {
 // TODO: ensure we are using the same relation?
 ClusterOrder opticsresult = optics.run(database);
 if(LOG.isVerbose()) {
  LOG.verbose("Extracting clusters with Xi: " + xi);
 }
 return extractClusters(opticsresult, relation, 1.0 - xi, optics.getMinPts());
}

代码示例来源：origin: elki-project/elki

/**
 * Performs the DiSH algorithm on the given database.
 *
 * @param relation Relation to process
 */
public Clustering<SubspaceModel> run(Database db, Relation<V> relation) {
 if(mu >= relation.size()) {
  throw new AbortException("Parameter mu is chosen unreasonably large. This won't yield meaningful results.");
 }
 DiSHClusterOrder opticsResult = new Instance(db, relation).run();
 if(LOG.isVerbose()) {
  LOG.verbose("Compute Clusters.");
 }
 return computeClusters(relation, opticsResult);
}

代码示例来源：origin: elki-project/elki

/**
 * Performs the Generalized LOF algorithm on the given database by calling
 * {@link #doRunInTime}.
 *
 * @param database Database to query
 * @param relation Data to process
 * @return LOF outlier result
 */
public OutlierResult run(Database database, Relation<O> relation) {
 StepProgress stepprog = LOG.isVerbose() ? new StepProgress("LOF", 3) : null;
 Pair<KNNQuery<O>, KNNQuery<O>> pair = getKNNQueries(database, relation, stepprog);
 KNNQuery<O> kNNRefer = pair.getFirst();
 KNNQuery<O> kNNReach = pair.getSecond();
 return doRunInTime(relation.getDBIDs(), kNNRefer, kNNReach, stepprog).getResult();
}

代码示例来源：origin: elki-project/elki

@Override
protected void preprocess() {
 createStorage();
 materialized_RkNN = DataStoreUtil.makeStorage(relation.getDBIDs(), DataStoreFactory.HINT_HOT, TreeSet.class);
 FiniteProgress progress = LOG.isVerbose() ? new FiniteProgress("Materializing k nearest neighbors and reverse k nearest neighbors (k=" + k + ")", relation.size(), getLogger()) : null;
 materializeKNNAndRKNNs(DBIDUtil.ensureArray(relation.getDBIDs()), progress);
}

代码示例来源：origin: de.lmu.ifi.dbs.elki/elki-index-preprocessed

@Override
protected void preprocess() {
 createStorage();
 materialized_RkNN = DataStoreUtil.makeStorage(relation.getDBIDs(), DataStoreFactory.HINT_HOT, TreeSet.class);
 FiniteProgress progress = LOG.isVerbose() ? new FiniteProgress("Materializing k nearest neighbors and reverse k nearest neighbors (k=" + k + ")", relation.size(), getLogger()) : null;
 materializeKNNAndRKNNs(DBIDUtil.ensureArray(relation.getDBIDs()), progress);
}

代码示例来源：origin: de.lmu.ifi.dbs.elki/elki

@Override
protected void preprocess() {
 createStorage();
 materialized_RkNN = DataStoreUtil.makeStorage(relation.getDBIDs(), DataStoreFactory.HINT_HOT, TreeSet.class);
 FiniteProgress progress = getLogger().isVerbose() ? new FiniteProgress("Materializing k nearest neighbors and reverse k nearest neighbors (k=" + k + ")", relation.size(), getLogger()) : null;
 materializeKNNAndRKNNs(DBIDUtil.ensureArray(relation.getDBIDs()), progress);
}

代码示例来源：origin: elki-project/elki

/**
 * Constructor for a single data set.
 *
 * @param db Database
 * @param relation Data relation
 */
public Instance(Database db, Relation<O> relation) {
 ids = relation.getDBIDs();
 processedIDs = DBIDUtil.newHashSet(ids.size());
 candidates = DBIDUtil.newArray();
 predecessor = DataStoreUtil.makeDBIDStorage(ids, DataStoreFactory.HINT_HOT);
 reachability = DataStoreUtil.makeDoubleStorage(ids, DataStoreFactory.HINT_DB | DataStoreFactory.HINT_HOT, Double.POSITIVE_INFINITY);
 progress = getLogger().isVerbose() ? new FiniteProgress("OPTICS", ids.size(), getLogger()) : null;
}

代码示例来源：origin: de.lmu.ifi.dbs.elki/elki-clustering

/**
 * Constructor for a single data set.
 *
 * @param db Database
 * @param relation Data relation
 */
public Instance(Database db, Relation<O> relation) {
 ids = relation.getDBIDs();
 processedIDs = DBIDUtil.newHashSet(ids.size());
 candidates = DBIDUtil.newArray();
 predecessor = DataStoreUtil.makeDBIDStorage(ids, DataStoreFactory.HINT_HOT);
 reachability = DataStoreUtil.makeDoubleStorage(ids, DataStoreFactory.HINT_DB | DataStoreFactory.HINT_HOT, Double.POSITIVE_INFINITY);
 progress = getLogger().isVerbose() ? new FiniteProgress("OPTICS", ids.size(), getLogger()) : null;
}

代码示例来源：origin: de.lmu.ifi.dbs.elki/elki

/**
 * Constructor for a single data set.
 *
 * @param db Database
 * @param relation Data relation
 */
public Instance(Database db, Relation<O> relation) {
 ids = relation.getDBIDs();
 processedIDs = DBIDUtil.newHashSet(ids.size());
 candidates = DBIDUtil.newArray();
 predecessor = DataStoreUtil.makeDBIDStorage(ids, DataStoreFactory.HINT_HOT);
 reachability = DataStoreUtil.makeDoubleStorage(ids, DataStoreFactory.HINT_DB | DataStoreFactory.HINT_HOT, Double.POSITIVE_INFINITY);
 progress = getLogger().isVerbose() ? new FiniteProgress("OPTICS", ids.size(), getLogger()) : null;
}

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

Logging

相关文章

    查看更多

    热门标签

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

    最新文章

    更多
    • 蜀ICP备2022004421号-2 NULL123 https://www.null123.com © All rights reserved
    • 本站内容来源互联网,如果侵犯您的权益请联系我们删除, 联系方式：448109455@qq.com