MLPACK
1.0.8
|
Go to the source code of this file.
Classes | |
class | mlpack::neighbor::RAQueryStat< SortPolicy > |
Extra data for each node in the tree. More... | |
class | mlpack::neighbor::RASearch< SortPolicy, MetricType, TreeType > |
The RASearch class: This class provides a generic manner to perform rank-approximate search via random-sampling. More... | |
Namespaces | |
namespace | mlpack |
Linear algebra utility functions, generally performed on matrices or vectors. | |
namespace | 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} }
This file is part of MLPACK 1.0.8.
MLPACK is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
MLPACK is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details (LICENSE.txt).
You should have received a copy of the GNU General Public License along with MLPACK. If not, see http://www.gnu.org/licenses/.
Definition in file ra_search.hpp.