Tabnine Logo
AnderbergHierarchicalClustering.findBest
Code IndexAdd Tabnine to your IDE (free)

How to use
findBest
method
in
de.lmu.ifi.dbs.elki.algorithm.clustering.hierarchical.AnderbergHierarchicalClustering

Best Java code snippets using de.lmu.ifi.dbs.elki.algorithm.clustering.hierarchical.AnderbergHierarchicalClustering.findBest (Showing top 6 results out of 315)

origin: de.lmu.ifi.dbs.elki/elki

/**
 * Update the cache.
 *
 * @param size Working set size
 * @param scratch Scratch matrix
 * @param bestd Best distance
 * @param besti Best index
 * @param x First cluster
 * @param y Second cluster, {@code y < x}
 * @param j Updated value d(y, j)
 * @param d New distance
 */
private void updateCache(int size, double[] scratch, double[] bestd, int[] besti, int x, int y, int j, double d) {
 // New best
 if(d <= bestd[j]) {
  bestd[j] = d;
  besti[j] = y;
  return;
 }
 // Needs slow upate.
 if(besti[j] == x || besti[j] == y) {
  findBest(size, scratch, bestd, besti, j);
 }
}
origin: elki-project/elki

/**
 * Update the cache.
 *
 * @param size Working set size
 * @param scratch Scratch matrix
 * @param bestd Best distance
 * @param besti Best index
 * @param x First cluster
 * @param y Second cluster, {@code y < x}
 * @param j Updated value d(y, j)
 * @param d New distance
 */
private void updateCache(int size, double[] scratch, double[] bestd, int[] besti, int x, int y, int j, double d) {
 // New best
 if(d <= bestd[j]) {
  bestd[j] = d;
  besti[j] = y;
  return;
 }
 // Needs slow update.
 if(besti[j] == x || besti[j] == y) {
  findBest(size, scratch, bestd, besti, j);
 }
}
origin: de.lmu.ifi.dbs.elki/elki-clustering

/**
 * Update the cache.
 *
 * @param size Working set size
 * @param scratch Scratch matrix
 * @param bestd Best distance
 * @param besti Best index
 * @param x First cluster
 * @param y Second cluster, {@code y < x}
 * @param j Updated value d(y, j)
 * @param d New distance
 */
private void updateCache(int size, double[] scratch, double[] bestd, int[] besti, int x, int y, int j, double d) {
 // New best
 if(d <= bestd[j]) {
  bestd[j] = d;
  besti[j] = y;
  return;
 }
 // Needs slow update.
 if(besti[j] == x || besti[j] == y) {
  findBest(size, scratch, bestd, besti, j);
 }
}
origin: de.lmu.ifi.dbs.elki/elki

findBest(size, scratch, bestd, besti, y);
origin: elki-project/elki

findBest(size, mat.matrix, bestd, besti, y);
origin: de.lmu.ifi.dbs.elki/elki-clustering

findBest(size, mat.matrix, bestd, besti, y);
de.lmu.ifi.dbs.elki.algorithm.clustering.hierarchicalAnderbergHierarchicalClusteringfindBest

Popular methods of AnderbergHierarchicalClustering

  • <init>
    Constructor.
  • findMerge
    Perform the next merge step. Due to the cache, this is now O(n) each time, instead of O(n*n).
  • getDistanceFunction
  • initializeNNCache
    Initialize the NN cache.
  • merge
    Execute the cluster merge.
  • updateCache
    Update the cache.
  • updateMatrix
    Update the scratch distance matrix.

Popular in Java

  • Finding current android device location
  • orElseThrow (Optional)
    Return the contained value, if present, otherwise throw an exception to be created by the provided s
  • compareTo (BigDecimal)
  • getContentResolver (Context)
  • Graphics2D (java.awt)
    This Graphics2D class extends the Graphics class to provide more sophisticated control overgraphics
  • HttpURLConnection (java.net)
    An URLConnection for HTTP (RFC 2616 [http://tools.ietf.org/html/rfc2616]) used to send and receive d
  • Timestamp (java.sql)
    A Java representation of the SQL TIMESTAMP type. It provides the capability of representing the SQL
  • List (java.util)
    An ordered collection (also known as a sequence). The user of this interface has precise control ove
  • Set (java.util)
    A Set is a data structure which does not allow duplicate elements.
  • Filter (javax.servlet)
    A filter is an object that performs filtering tasks on either the request to a resource (a servlet o
  • Top Sublime Text plugins
Tabnine Logo
  • Products

    Search for Java codeSearch for JavaScript code
  • IDE Plugins

    IntelliJ IDEAWebStormVisual StudioAndroid StudioEclipseVisual Studio CodePyCharmSublime TextPhpStormVimGoLandRubyMineEmacsJupyter NotebookJupyter LabRiderDataGripAppCode
  • Company

    About UsContact UsCareers
  • Resources

    FAQBlogTabnine AcademyTerms of usePrivacy policyJava Code IndexJavascript Code Index
Get Tabnine for your IDE now