Package | Description |
---|---|
weka.core.neighboursearch | |
weka.core.neighboursearch.kdtrees |
Modifier and Type | Method and Description |
---|---|
void |
KDTree.assignSubToCenters(KDTreeNode node,
Instances centers,
int[] centList,
int[] assignments)
Assigns instances of this node to center.
|
Modifier and Type | Field and Description |
---|---|
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.
|
Modifier and Type | Method and Description |
---|---|
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 |
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.
|
abstract void |
KDTreeNodeSplitter.splitNode(KDTreeNode node,
int numNodesCreated,
double[][] nodeRanges,
double[][] universe)
Splits a node into two.
|
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.
|
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.
|
Copyright © 2019 University of Waikato, Hamilton, NZ. All rights reserved.