Package elki.clustering.hierarchical
Class MiniMaxAnderberg<O>
- java.lang.Object
-
- elki.clustering.hierarchical.MiniMax<O>
-
- elki.clustering.hierarchical.MiniMaxAnderberg<O>
-
- All Implemented Interfaces:
elki.Algorithm,HierarchicalClusteringAlgorithm
@Reference(authors="M. R. Anderberg", title="Hierarchical Clustering Methods", booktitle="Cluster Analysis for Applications", bibkey="books/academic/Anderberg73/Ch6") @Priority(195) public class MiniMaxAnderberg<O> extends MiniMax<O>This is a modification of the classic MiniMax algorithm for hierarchical clustering using a nearest-neighbor heuristic for acceleration.This optimization is attributed to M. R. Anderberg.
Reference:
M. R. Anderberg
Hierarchical Clustering Methods
Cluster Analysis for Applications
ISBN: 0120576503- Since:
- 0.7.5
- Author:
- Julian Erhard, Erich Schubert
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description static classMiniMaxAnderberg.InstanceMain worker instance of MiniMax.
-
Constructor Summary
Constructors Constructor Description MiniMaxAnderberg(elki.distance.Distance<? super O> distance)Constructor.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description ClusterPrototypeMergeHistoryrun(elki.database.relation.Relation<O> relation)Run the algorithm-
Methods inherited from class elki.clustering.hierarchical.MiniMax
getInputTypeRestriction, initializeMatrices
-
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
-
Methods inherited from interface elki.clustering.hierarchical.HierarchicalClusteringAlgorithm
autorun
-
-
-
-
Constructor Detail
-
MiniMaxAnderberg
public MiniMaxAnderberg(elki.distance.Distance<? super O> distance)
Constructor.- Parameters:
distance- Distance function to use
-
-
Method Detail
-
run
public ClusterPrototypeMergeHistory run(elki.database.relation.Relation<O> relation)
Run the algorithm
-
-