Class ClusteringTreeHeadNode

  • All Implemented Interfaces:
    Serializable, MOAObject

    public class ClusteringTreeHeadNode
    extends ClusteringTreeNode
    Provides a ClusteringTreeNode with an extended nearest neighbor search in the root. Citation: Hendrik Fichtenberger, Marc Gillé, Melanie Schmidt, Chris Schwiegelshohn, Christian Sohler: BICO: BIRCH Meets Coresets for k-Means Clustering. ESA 2013: 481-492 (2013) http://ls2-www.cs.tu-dortmund.de/bico/
    See Also:
    Serialized Form
    • Constructor Detail

      • ClusteringTreeHeadNode

        public ClusteringTreeHeadNode​(double[] center,
                                      ClusteringFeature cf,
                                      int dimension,
                                      int numProjections,
                                      int hashSize,
                                      Random random)
        Creates a ClusteringTreeNode with an extended nearest neighbor search in the root.
        Parameters:
        dimension - the number of dimensions of the points
        numProjections - the number of projections to use for the nearest neighbor search
        hashSize - size of the hash function (must be smaller than 31)
        random - instance to generate a stream of pseudorandom numbers