Class 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 class  MiniMaxAnderberg.Instance
      Main worker instance of MiniMax.
      • Nested classes/interfaces inherited from interface elki.Algorithm

        elki.Algorithm.Utils
    • Field Summary

      Fields 
      Modifier and Type Field Description
      private static elki.logging.Logging LOG
      Class logger
    • Constructor Summary

      Constructors 
      Constructor Description
      MiniMaxAnderberg​(elki.distance.Distance<? super O> distance)
      Constructor.
    • Field Detail

      • LOG

        private static final elki.logging.Logging LOG
        Class logger
    • 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
        Overrides:
        run in class MiniMax<O>
        Parameters:
        relation - Relation
        Returns:
        Clustering hierarchy