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

How to use
getDistanceFunction
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.getDistanceFunction (Showing top 8 results out of 315)

origin: elki-project/elki

@Override
public TypeInformation[] getInputTypeRestriction() {
 // The input relation must match our distance function:
 return TypeUtil.array(getDistanceFunction().getInputTypeRestriction());
}
origin: de.lmu.ifi.dbs.elki/elki

@Override
public TypeInformation[] getInputTypeRestriction() {
 // The input relation must match our distance function:
 return TypeUtil.array(getDistanceFunction().getInputTypeRestriction());
}
origin: de.lmu.ifi.dbs.elki/elki-clustering

@Override
public TypeInformation[] getInputTypeRestriction() {
 // The input relation must match our distance function:
 return TypeUtil.array(getDistanceFunction().getInputTypeRestriction());
}
origin: de.lmu.ifi.dbs.elki/elki

DistanceQuery<O> dq = db.getDistanceQuery(relation, getDistanceFunction());
ArrayDBIDs ids = DBIDUtil.ensureArray(relation.getDBIDs());
final int size = ids.size();
origin: elki-project/elki

 LOG.verbose("Notice: SLINK is a much faster algorithm for single-linkage clustering!");
DistanceQuery<O> dq = db.getDistanceQuery(relation, getDistanceFunction());
final DBIDs ids = relation.getDBIDs();
MatrixParadigm mat = new MatrixParadigm(ids);
origin: de.lmu.ifi.dbs.elki/elki-clustering

 LOG.verbose("Notice: SLINK is a much faster algorithm for single-linkage clustering!");
DistanceQuery<O> dq = db.getDistanceQuery(relation, getDistanceFunction());
final DBIDs ids = relation.getDBIDs();
MatrixParadigm mat = new MatrixParadigm(ids);
origin: elki-project/elki

builder.add(ix, linkage.restore(mindist, getDistanceFunction().isSquared()), iy);
origin: de.lmu.ifi.dbs.elki/elki-clustering

builder.add(ix, linkage.restore(mindist, getDistanceFunction().isSquared()), iy);
de.lmu.ifi.dbs.elki.algorithm.clustering.hierarchicalAnderbergHierarchicalClusteringgetDistanceFunction

Popular methods of AnderbergHierarchicalClustering

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

Popular in Java

  • Start an intent from android
  • setScale (BigDecimal)
  • getExternalFilesDir (Context)
  • getSupportFragmentManager (FragmentActivity)
  • Point (java.awt)
    A point representing a location in (x,y) coordinate space, specified in integer precision.
  • String (java.lang)
  • BigInteger (java.math)
    An immutable arbitrary-precision signed integer.FAST CRYPTOGRAPHY This implementation is efficient f
  • ServerSocket (java.net)
    This class represents a server-side socket that waits for incoming client connections. A ServerSocke
  • LinkedList (java.util)
    Doubly-linked list implementation of the List and Dequeinterfaces. Implements all optional list oper
  • Modifier (javassist)
    The Modifier class provides static methods and constants to decode class and member access modifiers
  • Best IntelliJ 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