HierarchicalClusteringAlgorithm (ELKI: Environment for DeveLoping KDD-Applications Supported by Index-Structures)

All Superinterfaces:

Algorithm

All Known Implementing Classes:

AGNES, Anderberg, CLINK, HACAM, HDBSCANLinearMemory, LinearMemoryNNChain, MedoidLinkage, MiniMax, MiniMaxAnderberg, MiniMaxNNChain, NaiveAgglomerativeHierarchicalClustering4, NNChain, OPTICSToHierarchical, SLINK, SLINKHDBSCANLinearMemory
```
public interface HierarchicalClusteringAlgorithm
extends Algorithm
```
Interface for hierarchical clustering algorithms.
This interface allows the algorithms to be used by, e.g., CutDendrogramByNumberOfClusters and CutDendrogramByHeight.

Since:

0.6.0

Author:

Erich Schubert

Nested Class Summary
- Nested classes/interfaces inherited from interface elki.Algorithm
  Algorithm.Utils

Method Summary

All Methods Instance Methods Default Methods
Modifier and Type	Method	Description
`default ClusterMergeHistory`	`autorun(Database database)`	Try to auto-run the algorithm on a database by calling a method called `run`, with an optional `Database` first, and with data relations as specified by `Algorithm.getInputTypeRestriction()`.

Methods inherited from interface elki.Algorithm
getInputTypeRestriction

- Method Detail
  - autorun
```
default ClusterMergeHistory autorun(Database database)
```
    Description copied from interface: Algorithm
    
    Try to auto-run the algorithm on a database by calling a method called run, with an optional Database first, and with data relations as specified by Algorithm.getInputTypeRestriction().
    
    Specified by:
    
    autorun in interface Algorithm
    
    Parameters:
    
    database - the database to run the algorithm on
    
    Returns:
    
    the Result computed by this algorithm