Package | Description |
---|---|
weka.core.neighboursearch.balltrees |
Modifier and Type | Field and Description |
---|---|
BallNode |
BallNode.m_Left
The left child of the node.
|
BallNode |
BallNode.m_Right
The right child of the node.
|
Modifier and Type | Method and Description |
---|---|
BallNode |
BottomUpConstructor.buildTree()
Builds the ball tree bottom up.
|
abstract BallNode |
BallTreeConstructor.buildTree()
Builds the ball tree.
|
BallNode |
TopDownConstructor.buildTree()
Builds the ball tree top down.
|
BallNode |
MiddleOutConstructor.buildTree()
Builds a ball tree middle out.
|
Modifier and Type | Method and Description |
---|---|
int[] |
BottomUpConstructor.addInstance(BallNode node,
Instance inst)
Adds an instance to the ball tree.
|
abstract int[] |
BallTreeConstructor.addInstance(BallNode node,
Instance inst)
Adds an instance to the ball tree.
|
int[] |
TopDownConstructor.addInstance(BallNode node,
Instance inst)
Adds an instance to the ball tree.
|
int[] |
MiddleOutConstructor.addInstance(BallNode node,
Instance inst)
Adds an instance to the tree.
|
static Instance |
BallNode.calcPivot(BallNode child1,
BallNode child2,
Instances insts)
Calculates the centroid pivot of a node based on its
two child nodes (if merging two nodes).
|
static double |
BallNode.calcRadius(BallNode child1,
BallNode child2,
Instance pivot,
DistanceFunction distanceFunction)
Calculates the radius of a node based on its two
child nodes (if merging two nodes).
|
void |
MedianDistanceFromArbitraryPoint.splitNode(BallNode node,
int numNodesCreated)
Splits a ball into two.
|
void |
PointsClosestToFurthestChildren.splitNode(BallNode node,
int numNodesCreated)
Splits a ball into two.
|
void |
MedianOfWidestDimension.splitNode(BallNode node,
int numNodesCreated)
Splits a ball into two.
|
abstract void |
BallSplitter.splitNode(BallNode node,
int numNodesCreated)
Splits a node into two.
|
Copyright © 2019 University of Waikato, Hamilton, NZ. All rights reserved.