- <init>
Creates a new instance of KDTree. It also builds the tree on supplied set of
Instances.
- addInstanceInfo
Adds one instance to KDTree loosly. It only changes the ranges in
EuclideanDistance, and does not af
- addInstanceToTree
Recursively adds an instance to the tree starting from the supplied KDTreeNode.
NOTE: This should no
- afterAddInstance
Corrects the start and end indices of a KDTreeNode after an instance is added to
the tree. The start
- assignSubToCenters
Assigns instances of this node to center. Center to be assign to is decided by
the distance function
- candidateIsFullOwner
Returns true if candidate is a full owner in respect to a competitor. The
candidate has been the clo
- checkMissing
Checks if there is any instance with missing values. Throws an exception if
there is, as KDTree does
- clipToInsideHrect
Finds the closest point in the hyper rectangle to a given point. Change the
given point to this clos
- determineAssignments
Assigns instances to the current centers called candidates.
- distanceToHrect
Returns the distance between a point and an hyperrectangle.
- findNearestNeighbours
Returns (in the supplied heap object) the k nearest neighbours of the given
instance starting from t
- getMaxInstInLeaf
Get the maximum number of instances in a leaf.