Uses of Class
moa.classifiers.lazy.neighboursearch.kdtrees.KDTreeNodeSplitter
-
Packages that use KDTreeNodeSplitter Package Description moa.classifiers.lazy.neighboursearch moa.classifiers.lazy.neighboursearch.kdtrees -
-
Uses of KDTreeNodeSplitter in moa.classifiers.lazy.neighboursearch
Fields in moa.classifiers.lazy.neighboursearch declared as KDTreeNodeSplitter Modifier and Type Field Description protected KDTreeNodeSplitter
KDTree. m_Splitter
The node splitter.Methods in moa.classifiers.lazy.neighboursearch that return KDTreeNodeSplitter Modifier and Type Method Description KDTreeNodeSplitter
KDTree. getNodeSplitter()
Returns the splitting method currently in use to split the nodes of the KDTree.Methods in moa.classifiers.lazy.neighboursearch with parameters of type KDTreeNodeSplitter Modifier and Type Method Description void
KDTree. setNodeSplitter(KDTreeNodeSplitter splitter)
Sets the splitting method to use to split the nodes of the KDTree. -
Uses of KDTreeNodeSplitter in moa.classifiers.lazy.neighboursearch.kdtrees
Subclasses of KDTreeNodeSplitter in moa.classifiers.lazy.neighboursearch.kdtrees Modifier and Type Class Description class
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).class
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.class
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).class
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.
-