Package weka.core.neighboursearch.kdtrees
package weka.core.neighboursearch.kdtrees
-
ClassesClassDescriptionA class representing a KDTree node.Class that splits up a KDTreeNode.The class that splits a node into two such that the overall sum of squared distances of points to their centres on both sides of the (axis-parallel) splitting plane is minimum.
For more information see also:
Ashraf Masood Kibriya (2007).The class that splits a KDTree node based on the median value of a dimension in which the node's points have the widest spread.
For more information see also:
Jerome H.The class that splits a KDTree node based on the midpoint value of a dimension in which the node's points have the widest spread.
For more information see also:
Andrew Moore (1991).The class that splits a node into two based on the midpoint value of the dimension in which the node's rectangle is widest.