Package | Description |
---|---|
weka.core.neighboursearch | |
weka.core.neighboursearch.balltrees |
Modifier and Type | Field and Description |
---|---|
protected BallNode |
BallTree.m_Root
The root node of the BallTree.
|
Modifier and Type | Method and Description |
---|---|
protected void |
BallTree.nearestNeighbours(NearestNeighbourSearch.MyHeap heap,
BallNode node,
Instance target,
int k)
Does NN search according to Moore's method.
|
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 |
MiddleOutConstructor.buildTree()
Builds a ball tree middle out.
|
BallNode |
TopDownConstructor.buildTree()
Builds the ball tree top down.
|
protected BallNode |
MiddleOutConstructor.buildTreeMiddleOut(int startIdx,
int endIdx)
Builds a ball tree middle out from the
portion of the master index array given
by supplied start and end index.
|
protected BallNode |
BottomUpConstructor.makeBallTree(BottomUpConstructor.TempNode node,
int startidx,
int endidx,
int[] instList,
int depth,
double rootRadius)
Makes ball tree nodes of temp nodes that were used
in the merging process.
|
protected BallNode |
MiddleOutConstructor.makeBallTreeNodes(MiddleOutConstructor.TempNode node,
int startidx,
int endidx,
int depth)
Makes BallTreeNodes out of TempNodes.
|
protected BallNode |
BottomUpConstructor.mergeNodes(FastVector list,
int startIdx,
int endIdx,
int[] instList)
Merges nodes into one top node.
|
protected BallNode |
MiddleOutConstructor.mergeNodes(Vector list,
int startIdx,
int endIdx)
Merges nodes created by createAnchorsHierarchy()
into one top node.
|
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[] |
MiddleOutConstructor.addInstance(BallNode node,
Instance inst)
Adds an instance to the tree.
|
int[] |
TopDownConstructor.addInstance(BallNode node,
Instance inst)
Adds an instance to the ball tree.
|
protected void |
MiddleOutConstructor.buildLeavesMiddleOut(BallNode node)
Applies the middle out build procedure to
the leaves of 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).
|
protected void |
TopDownConstructor.processNodesAfterAddInstance(BallNode node)
Post process method to correct the start and end
indices of BallNodes on the right of the
node where the instance was added.
|
void |
MedianOfWidestDimension.splitNode(BallNode node,
int numNodesCreated)
Splits a ball into two.
|
void |
MedianDistanceFromArbitraryPoint.splitNode(BallNode node,
int numNodesCreated)
Splits a ball into two.
|
abstract void |
BallSplitter.splitNode(BallNode node,
int numNodesCreated)
Splits a node into two.
|
void |
PointsClosestToFurthestChildren.splitNode(BallNode node,
int numNodesCreated)
Splits a ball into two.
|
protected void |
TopDownConstructor.splitNodes(BallNode node,
int depth,
double rootRadius)
Recursively splits nodes of a ball tree until
<=m_MaxInstancesInLeaf instances remain in a node.
|
Copyright © 2015 University of Waikato, Hamilton, NZ. All rights reserved.