mlpack
master
|
Go to the source code of this file.
Classes | |
class | mlpack::neighbor::RAModel< SortPolicy > |
The RAModel class provides an abstraction for the RASearch class, abstracting away the TreeType parameter and allowing it to be specified at runtime in this class. More... | |
class | mlpack::neighbor::RASearch< SortPolicy, MetricType, MatType, TreeType > |
The RASearch class: This class provides a generic manner to perform rank-approximate search via random-sampling. More... | |
Namespaces | |
mlpack | |
Linear algebra utility functions, generally performed on matrices or vectors. | |
mlpack::neighbor | |
Neighbor-search routines. | |
Defines the RASearch class, which performs an abstract rank-approximate nearest/farthest neighbor query on two datasets.
The details of this method can be found in the following paper:
{ram2009rank, title={{Rank-Approximate Nearest Neighbor Search: Retaining Meaning and Speed in High Dimensions}}, author={{Ram, P. and Lee, D. and Ouyang, H. and Gray, A. G.}}, booktitle={{Advances of Neural Information Processing Systems}}, year={2009} }
mlpack is free software; you may redistribute it and/or modify it under the terms of the 3-clause BSD license. You should have received a copy of the 3-clause BSD license along with mlpack. If not, see http://www.opensource.org/licenses/BSD-3-Clause for more information.
Definition in file ra_search.hpp.