#include <mlpack/prereqs.hpp>#include <mlpack/core/tree/binary_space_tree.hpp>#include <mlpack/core/metrics/lmetric.hpp>#include <mlpack/methods/neighbor_search/sort_policies/nearest_neighbor_sort.hpp>#include "ra_query_stat.hpp"#include "ra_util.hpp"#include "ra_search_impl.hpp"#include "ra_typedef.hpp"
Include dependency graph for ra_search.hpp:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Classes | |
| class | mlpack::neighbor::LeafSizeRAWrapper< TreeType > |
| LeafSizeRAWrapper wraps any RASearch type that needs to be able to take the leaf size into account when building trees. 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. | |
Detailed Description
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:
@inproceedings{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.
