Overview | Package | Class | Tree | Deprecated | Index | Help | Weka's home
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES

## Package weka.core.neighboursearch.kdtrees

Class Summary
KDTreeNode | A class representing a KDTree node.
KDTreeNodeSplitter | Class that splits up a KDTreeNode.
KMeansInpiredMethod | 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).
MedianOfWidestDimension | 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.
MidPointOfWidestDimension | 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).
SlidingMidPointOfWidestSide | The class that splits a node into two based on the midpoint value of the dimension in which the node's rectangle is widest.

Overview | Package | Class | Tree | Deprecated | Index | Help | Weka's home
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES