de.lmu.ifi.dbs.elki.algorithm.clustering.hierarchical

Interface HierarchicalClusteringAlgorithm

All Superinterfaces:

Algorithm

All Known Implementing Classes:

AGNES, AnderbergHierarchicalClustering, CLINK, CutDendrogramByHeightExtractor.DummyHierarchicalClusteringAlgorithm, HDBSCANLinearMemory, MiniMax, MiniMaxAnderberg, MiniMaxNNChain, NaiveAgglomerativeHierarchicalClustering4, NNChain, 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

Method Summary

Modifier and Type	Method and Description
PointerHierarchyRepresentationResult	run(Database db) Runs the algorithm.

Methods inherited from interface de.lmu.ifi.dbs.elki.algorithm.Algorithm

getInputTypeRestriction

Method Detail

run

PointerHierarchyRepresentationResult run(Database db)

Description copied from interface: Algorithm

Runs the algorithm.

Specified by:

run in interface Algorithm

Parameters:

db - the database to run the algorithm on

Returns:

the Result computed by this algorithm