类 PointsClosestToFurthestChildren
java.lang.Object
weka.core.neighboursearch.balltrees.BallSplitter
weka.core.neighboursearch.balltrees.PointsClosestToFurthestChildren
public class PointsClosestToFurthestChildren
extends BallSplitter
implements TechnicalInformationHandler
Implements the Moore's method to split a node of a ball tree.
For more information please see section 2 of the 1st and 3.2.3 of the 2nd:
Andrew W. Moore: The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data. In: UAI '00: Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence, San Francisco, CA, USA, 397-405, 2000.
Ashraf Masood Kibriya (2007). Fast Algorithms for Nearest Neighbour Search. Hamilton, New Zealand. BibTeX:
For more information please see section 2 of the 1st and 3.2.3 of the 2nd:
Andrew W. Moore: The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data. In: UAI '00: Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence, San Francisco, CA, USA, 397-405, 2000.
Ashraf Masood Kibriya (2007). Fast Algorithms for Nearest Neighbour Search. Hamilton, New Zealand. BibTeX:
@inproceedings{Moore2000, address = {San Francisco, CA, USA}, author = {Andrew W. Moore}, booktitle = {UAI '00: Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence}, pages = {397-405}, publisher = {Morgan Kaufmann Publishers Inc.}, title = {The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data}, year = {2000} } @mastersthesis{Kibriya2007, address = {Hamilton, New Zealand}, author = {Ashraf Masood Kibriya}, school = {Department of Computer Science, School of Computing and Mathematical Sciences, University of Waikato}, title = {Fast Algorithms for Nearest Neighbour Search}, year = {2007} }
- 版本:
- $Revision: 1.2 $
- 作者:
- Ashraf M. Kibriya (amk14[at-the-rate]cs[dot]waikato[dot]ac[dot]nz)
- 另请参阅:
-
构造器概要
构造器构造器说明Constructor.PointsClosestToFurthestChildren
(int[] instList, Instances insts, EuclideanDistance e) Constructor. -
方法概要
修饰符和类型方法说明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 object.void
Splits a ball into two.从类继承的方法 weka.core.neighboursearch.balltrees.BallSplitter
getOptions, listOptions, setEuclideanDistanceFunction, setInstanceList, setInstances, setOptions
-
构造器详细资料
-
PointsClosestToFurthestChildren
public PointsClosestToFurthestChildren()Constructor. -
PointsClosestToFurthestChildren
Constructor.- 参数:
instList
- The master index array.insts
- The instances on which the tree is (or is to be) built.e
- The Euclidean distance function to use for splitting.
-
-
方法详细资料
-
globalInfo
Returns a string describing this object.- 返回:
- 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
Splits a ball into two.- 指定者:
splitNode
在类中BallSplitter
- 参数:
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.- 抛出:
Exception
- If there is some problem in splitting the given node.
-
getRevision
Returns the revision string.- 指定者:
getRevision
在接口中RevisionHandler
- 覆盖:
getRevision
在类中BallSplitter
- 返回:
- the revision
-