Uses of Class
weka.core.neighboursearch.kdtrees.KDTreeNode

Packages that use KDTreeNode

weka.core.neighboursearch
weka.core.neighboursearch.kdtrees

Uses of KDTreeNode in weka.core.neighboursearch

Methods in weka.core.neighboursearch with parameters of type KDTreeNode

void	KDTree.assignSubToCenters(KDTreeNode node, Instances centers, int[] centList, int[] assignments) Assigns instances of this node to center.

Uses of KDTreeNode in weka.core.neighboursearch.kdtrees

Fields in weka.core.neighboursearch.kdtrees declared as KDTreeNode

KDTreeNode	KDTreeNode.m_Left left subtree; contains instances with smaller or equal to split value.
KDTreeNode	KDTreeNode.m_Right right subtree; contains instances with larger than split value.

Methods in weka.core.neighboursearch.kdtrees with parameters of type KDTreeNode

void	MidPointOfWidestDimension.splitNode(KDTreeNode node, int numNodesCreated, double[][] nodeRanges, double[][] universe) Splits a node into two based on the midpoint value of the dimension in which the points have the widest spread.
void	KMeansInpiredMethod.splitNode(KDTreeNode node, int numNodesCreated, double[][] nodeRanges, double[][] universe) 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.
void	SlidingMidPointOfWidestSide.splitNode(KDTreeNode node, int numNodesCreated, double[][] nodeRanges, double[][] universe) Splits a node into two based on the midpoint value of the dimension in which the node's rectangle is widest.
abstract void	KDTreeNodeSplitter.splitNode(KDTreeNode node, int numNodesCreated, double[][] nodeRanges, double[][] universe) Splits a node into two.
void	MedianOfWidestDimension.splitNode(KDTreeNode node, int numNodesCreated, double[][] nodeRanges, double[][] universe) Splits a node into two based on the median value of the dimension in which the points have the widest spread.