public class ClusteringTreeHeadNode extends ClusteringTreeNode
Constructor and Description |
---|
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.
|
Modifier and Type | Method and Description |
---|---|
boolean |
addChild(ClusteringTreeNode e)
Adds a child node.
|
void |
clearChildren()
Removes all children nodes.
|
ClusteringTreeNode |
nearestChild(double[] pointA)
Searches for the nearest child node by comparing each representation.
|
addToClustering, addToClusteringCenters, count, getCenter, getChildren, getClusteringFeature, getDescription, getThreshold, hasNoChildren, printClusteringCenters, setCenter, setThreshold
copy, copy, measureByteSize, measureByteSize, toString
public ClusteringTreeHeadNode(double[] center, ClusteringFeature cf, int dimension, int numProjections, int hashSize, Random random)
dimension
- the number of dimensions of the pointsnumProjections
- the number of projections to use for the nearest neighbor
searchhashSize
- size of the hash function (must be smaller than 31)random
- instance to generate a stream of pseudorandom numberspublic ClusteringTreeNode nearestChild(double[] pointA)
ClusteringTreeNode
nearestChild
in class ClusteringTreeNode
pointA
- to find the nearest child forpublic boolean addChild(ClusteringTreeNode e)
ClusteringTreeNode
addChild
in class ClusteringTreeNode
e
- the child node to addtrue
List.add(java.lang.Object)
public void clearChildren()
ClusteringTreeNode
clearChildren
in class ClusteringTreeNode
List.clear()
Copyright © 2019 University of Waikato, Hamilton, NZ. All Rights Reserved.