Class OPTICSHeap<O>

  • Type Parameters:
    O - the type of objects handled by the algorithm
    All Implemented Interfaces:
    Algorithm, OPTICSTypeAlgorithm

    @Title("OPTICS: Density-Based Hierarchical Clustering (implementation using a heap)")
    @Reference(authors="Mihael Ankerst, Markus M. Breunig, Hans-Peter Kriegel, J\u00f6rg Sander",
               title="OPTICS: Ordering Points to Identify the Clustering Structure",
               booktitle="Proc. ACM SIGMOD Int. Conf. on Management of Data (SIGMOD \'99)",
               url="https://doi.org/10.1145/304181.304187",
               bibkey="DBLP:conf/sigmod/AnkerstBKS99")
    public class OPTICSHeap<O>
    extends AbstractOPTICS<O>
    The OPTICS algorithm for density-based hierarchical clustering.

    Algorithm to find density-connected sets in a database based on the parameters 'minPts' and 'epsilon' (specifying a volume). These two parameters determine a density threshold for clustering.

    This implementation uses a heap.

    Reference:

    Mihael Ankerst, Markus M. Breunig, Hans-Peter Kriegel, Jörg Sander
    OPTICS: Ordering Points to Identify the Clustering Structure
    Proc. ACM SIGMOD Int. Conf. on Management of Data (SIGMOD '99)

    Since:
    0.1
    Author:
    Elke Achtert, Erich Schubert
    • Field Detail

      • LOG

        private static final Logging LOG
        The logger for this class.
    • Constructor Detail

      • OPTICSHeap

        public OPTICSHeap​(Distance<? super O> distance,
                          double epsilon,
                          int minpts)
        Constructor.
        Parameters:
        distance - Distance function
        epsilon - Epsilon value
        minpts - Minpts value