类 SlidingMidPointOfWidestSide
java.lang.Object
weka.core.neighboursearch.kdtrees.KDTreeNodeSplitter
weka.core.neighboursearch.kdtrees.SlidingMidPointOfWidestSide
public class SlidingMidPointOfWidestSide
extends KDTreeNodeSplitter
implements TechnicalInformationHandler
The class that splits a node into two based on the midpoint value of the dimension in which the node's rectangle is widest. If after splitting one side is empty then it is slided towards the non-empty side until there is at least one point on the empty side.
For more information see also:
David M. Mount (2006). ANN Programming Manual. College Park, MD, USA. BibTeX:
For more information see also:
David M. Mount (2006). ANN Programming Manual. College Park, MD, USA. BibTeX:
@manual{Mount2006, address = {College Park, MD, USA}, author = {David M. Mount}, organization = {Department of Computer Science, University of Maryland}, title = {ANN Programming Manual}, year = {2006}, HTTP = {Available from http://www.cs.umd.edu/\~mount/ANN/} }
- 版本:
- $Revision: 1.3 $
- 作者:
- Ashraf M. Kibriya (amk14@waikato.ac.nz)
- 另请参阅:
-
字段概要
从类继承的字段 weka.core.neighboursearch.kdtrees.KDTreeNodeSplitter
MAX, MIN, WIDTH
-
构造器概要
构造器 -
方法概要
修饰符和类型方法说明Returns the revision string.Returns an instance of a TechnicalInformation object, containing detailed information about the technical background of this class, e.g., paper reference or book this class is based on.Returns a string describing this nearest neighbour search algorithm.void
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.从类继承的方法 weka.core.neighboursearch.kdtrees.KDTreeNodeSplitter
getOptions, listOptions, setEuclideanDistanceFunction, setInstanceList, setInstances, setNodeWidthNormalization, setOptions
-
构造器详细资料
-
SlidingMidPointOfWidestSide
public SlidingMidPointOfWidestSide()
-
-
方法详细资料
-
globalInfo
Returns a string describing this nearest neighbour search algorithm.- 返回:
- a description of the algorithm for displaying in the explorer/experimenter gui
-
getTechnicalInformation
Returns an instance of a TechnicalInformation object, containing detailed information about the technical background of this class, e.g., paper reference or book this class is based on.- 指定者:
getTechnicalInformation
在接口中TechnicalInformationHandler
- 返回:
- the technical information about this class
-
splitNode
public void splitNode(KDTreeNode node, int numNodesCreated, double[][] nodeRanges, double[][] universe) throws Exception Splits a node into two based on the midpoint value of the dimension in which the node's rectangle is widest. If after splitting one side is empty then it is slided towards the non-empty side until there is at least one point on the empty side. The two nodes created after the whole splitting are correctly initialised. And, node.left and node.right are set appropriately.- 指定者:
splitNode
在类中KDTreeNodeSplitter
- 参数:
node
- The node to split.numNodesCreated
- The number of nodes that so far have been created for the tree, so that the newly created nodes are assigned correct/meaningful node numbers/ids.nodeRanges
- The attributes' range for the points inside the node that is to be split.universe
- The attributes' range for the whole point-space.- 抛出:
Exception
- If there is some problem in splitting the given node.
-
getRevision
Returns the revision string.- 指定者:
getRevision
在接口中RevisionHandler
- 覆盖:
getRevision
在类中KDTreeNodeSplitter
- 返回:
- the revision
-