O - Object typepublic class NaiveAgglomerativeHierarchicalClustering1<O> extends AbstractDistanceBasedAlgorithm<O,Result>
This is the first step, where we implement it with single linkage only, and extract a fixed number of clusters. The follow up variants will be made more flexible.
This is the naive O(n³) algorithm. See SLINK for a much faster
algorithm (however, only for single-linkage).
| Modifier and Type | Class and Description |
|---|---|
static class |
NaiveAgglomerativeHierarchicalClustering1.Parameterizer<O>
Parameterization class
|
| Modifier and Type | Field and Description |
|---|---|
private static Logging |
LOG
Class logger
|
(package private) int |
numclusters
Threshold, how many clusters to extract.
|
ALGORITHM_IDDISTANCE_FUNCTION_ID| Constructor and Description |
|---|
NaiveAgglomerativeHierarchicalClustering1(DistanceFunction<? super O> distanceFunction,
int numclusters)
Constructor.
|
| Modifier and Type | Method and Description |
|---|---|
TypeInformation[] |
getInputTypeRestriction()
Get the input type restriction used for negotiating the data query.
|
protected Logging |
getLogger()
Get the (STATIC) logger for this class.
|
Result |
run(Database db,
Relation<O> relation)
Run the algorithm
|
getDistanceFunctionrunprivate static final Logging LOG
int numclusters
public NaiveAgglomerativeHierarchicalClustering1(DistanceFunction<? super O> distanceFunction, int numclusters)
distanceFunction - Distance function to usenumclusters - Number of clusterspublic Result run(Database db, Relation<O> relation)
db - Databaserelation - Relationpublic TypeInformation[] getInputTypeRestriction()
AbstractAlgorithmgetInputTypeRestriction in interface AlgorithmgetInputTypeRestriction in class AbstractAlgorithm<Result>protected Logging getLogger()
AbstractAlgorithmgetLogger in class AbstractAlgorithm<Result>Copyright © 2019 ELKI Development Team. License information.