Tabnine Logo
de.lmu.ifi.dbs.elki.algorithm.clustering.hierarchical
Code IndexAdd Tabnine to your IDE (free)

How to use de.lmu.ifi.dbs.elki.algorithm.clustering.hierarchical

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

origin: elki-project/elki

/**
 * Constructor.
 *
 * @param pointerresult Hierarchical result
 */
public Instance(PointerHierarchyRepresentationResult pointerresult) {
 this.ids = pointerresult.topologicalSort();
 this.pi = pointerresult.getParentStore();
 this.lambda = pointerresult.getParentDistanceStore();
 this.pointerresult = pointerresult;
 if(pointerresult instanceof PointerDensityHierarchyRepresentationResult) {
  this.coredist = ((PointerDensityHierarchyRepresentationResult) pointerresult).getCoreDistanceStore();
 }
}
origin: elki-project/elki

 @Override
 protected CLINK<O> makeInstance() {
  return new CLINK<>(distanceFunction);
 }
}
origin: elki-project/elki

 @Override
 protected AnderbergHierarchicalClustering<O> makeInstance() {
  return new AnderbergHierarchicalClustering<>(distanceFunction, linkage);
 }
}
origin: elki-project/elki

/**
 * Constructor.
 *
 * @param pointerresult Hierarchical result
 */
public Instance(PointerHierarchyRepresentationResult pointerresult) {
 this.ids = pointerresult.topologicalSort();
 this.pi = pointerresult.getParentStore();
 this.lambda = pointerresult.getParentDistanceStore();
 this.pointerresult = pointerresult;
}
origin: de.lmu.ifi.dbs.elki/elki

 @Override
 protected SLINK<O> makeInstance() {
  return new SLINK<>(distanceFunction);
 }
}
origin: de.lmu.ifi.dbs.elki/elki

 @Override
 protected AGNES<O> makeInstance() {
  return new AGNES<>(distanceFunction, linkage);
 }
}
origin: de.lmu.ifi.dbs.elki/elki-clustering

 @Override
 protected SLINKHDBSCANLinearMemory<O> makeInstance() {
  return new SLINKHDBSCANLinearMemory<>(distanceFunction, minPts);
 }
}
origin: elki-project/elki

 @Override
 protected HDBSCANLinearMemory<O> makeInstance() {
  return new HDBSCANLinearMemory<>(distanceFunction, minPts);
 }
}
origin: elki-project/elki

@Override
public TypeInformation[] getInputTypeRestriction() {
 return algorithm.getInputTypeRestriction();
}
origin: elki-project/elki

 @Override
 protected NNChain<O> makeInstance() {
  return new NNChain<>(distanceFunction, linkage);
 }
}
origin: elki-project/elki

 @Override
 protected MiniMax<O> makeInstance() {
  return new MiniMax<>(distanceFunction);
 }
}
origin: elki-project/elki

 @Override
 protected MiniMaxNNChain<O> makeInstance() {
  return new MiniMaxNNChain<>(distanceFunction);
 }
}
origin: elki-project/elki

 @Override
 protected MiniMaxAnderberg<O> makeInstance() {
  return new MiniMaxAnderberg<>(distanceFunction);
 }
}
origin: elki-project/elki

/**
 * Constructor.
 *
 * @param pointerresult Hierarchical result
 */
public Instance(PointerHierarchyRepresentationResult pointerresult) {
 this.ids = pointerresult.topologicalSort();
 this.pi = pointerresult.getParentStore();
 this.lambda = pointerresult.getParentDistanceStore();
 this.pointerresult = pointerresult;
 if(pointerresult instanceof PointerDensityHierarchyRepresentationResult) {
  this.coredist = ((PointerDensityHierarchyRepresentationResult) pointerresult).getCoreDistanceStore();
 }
}
origin: de.lmu.ifi.dbs.elki/elki-clustering

 @Override
 protected CLINK<O> makeInstance() {
  return new CLINK<>(distanceFunction);
 }
}
origin: de.lmu.ifi.dbs.elki/elki-clustering

 @Override
 protected AGNES<O> makeInstance() {
  return new AGNES<>(distanceFunction, linkage);
 }
}
origin: elki-project/elki

 @Override
 protected SLINKHDBSCANLinearMemory<O> makeInstance() {
  return new SLINKHDBSCANLinearMemory<>(distanceFunction, minPts);
 }
}
origin: elki-project/elki

/**
 * Constructor.
 *
 * @param pointerresult Hierarchical result
 */
public Instance(PointerHierarchyRepresentationResult pointerresult) {
 this.ids = pointerresult.topologicalSort();
 this.pi = pointerresult.getParentStore();
 this.lambda = pointerresult.getParentDistanceStore();
 this.pointerresult = pointerresult;
 if(pointerresult instanceof PointerDensityHierarchyRepresentationResult) {
  this.coredist = ((PointerDensityHierarchyRepresentationResult) pointerresult).getCoreDistanceStore();
 }
}
origin: de.lmu.ifi.dbs.elki/elki-clustering

/**
 * Constructor.
 *
 * @param pointerresult Hierarchical result
 */
public Instance(PointerHierarchyRepresentationResult pointerresult) {
 this.ids = pointerresult.topologicalSort();
 this.pi = pointerresult.getParentStore();
 this.lambda = pointerresult.getParentDistanceStore();
 this.pointerresult = pointerresult;
 if(pointerresult instanceof PointerDensityHierarchyRepresentationResult) {
  this.coredist = ((PointerDensityHierarchyRepresentationResult) pointerresult).getCoreDistanceStore();
 }
}
origin: de.lmu.ifi.dbs.elki/elki-clustering

/**
 * Constructor.
 *
 * @param pointerresult Hierarchical result
 */
public Instance(PointerHierarchyRepresentationResult pointerresult) {
 this.ids = pointerresult.topologicalSort();
 this.pi = pointerresult.getParentStore();
 this.lambda = pointerresult.getParentDistanceStore();
 this.pointerresult = pointerresult;
 if(pointerresult instanceof PointerDensityHierarchyRepresentationResult) {
  this.coredist = ((PointerDensityHierarchyRepresentationResult) pointerresult).getCoreDistanceStore();
 }
}
de.lmu.ifi.dbs.elki.algorithm.clustering.hierarchical

Most used classes

  • PointerHierarchyRepresentationResult
    The pointer representation of a hierarchical clustering. Each object is represented by a parent obje
  • SLINK
    Implementation of the efficient Single-Link Algorithm SLINK of R. Sibson. This is probably the faste
  • CutDendrogramByHeight
    Extract a flat clustering from a full hierarchy, represented in pointer form.
  • HDBSCANHierarchyExtraction
    Extraction of simplified cluster hierarchies, as proposed in HDBSCAN. In contrast to the authors top
  • SimplifiedHierarchyExtraction
    Extraction of simplified cluster hierarchies, as proposed in HDBSCAN. In contrast to the authors top
  • AbstractHDBSCAN$HDBSCANAdapter,
  • AbstractHDBSCAN$HeapMSTCollector,
  • AbstractHDBSCAN,
  • AnderbergHierarchicalClustering,
  • CLINK,
  • HDBSCANLinearMemory,
  • HierarchicalClusteringAlgorithm,
  • PointerDensityHierarchyRepresentationResult,
  • PointerHierarchyRepresentationBuilder,
  • SLINKHDBSCANLinearMemory,
  • BIRCHLeafClustering,
  • ClustersWithNoiseExtraction,
  • CutDendrogramByNumberOfClusters,
  • HDBSCANHierarchyExtraction$TempCluster
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