ra_typedef.hpp File Reference

#include "ra_search.hpp"
#include <mlpack/core/metrics/lmetric.hpp>
#include <mlpack/methods/neighbor_search/sort_policies/nearest_neighbor_sort.hpp>
#include <mlpack/methods/neighbor_search/sort_policies/furthest_neighbor_sort.hpp>

Include dependency graph for ra_typedef.hpp:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces
	mlpack
	Linear algebra utility functions, generally performed on matrices or vectors.

Typedefs
typedef RASearch	mlpack::neighbor::KRANN
	The KRANN class is the k-rank-approximate-nearest-neighbors method. More...
typedef RASearch< FurthestNeighborSort >	mlpack::neighbor::KRAFN
	The KRAFN class is the k-rank-approximate-farthest-neighbors method. More...

Detailed Description

Author

Parikshit Ram

Simple typedefs describing template instantiations of the RASearch class which are commonly used.

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.

Typedef Documentation

KRAFN

typedef RASearch<FurthestNeighborSort> mlpack::neighbor::KRAFN

The KRAFN class is the k-rank-approximate-farthest-neighbors method.

It returns L2 distances for each of the k rank-approximate farthest-neighbors.

The approximation is controlled with two parameters (see allkrann_main.cpp) which can be specified at search time. So the tree building is done only once while the search can be performed multiple times with different approximation levels.

KRANN

typedef RASearch mlpack::neighbor::KRANN

The KRANN class is the k-rank-approximate-nearest-neighbors method.

It returns L2 distances for each of the k rank-approximate nearest-neighbors.

The approximation is controlled with two parameters (see allkrann_main.cpp) which can be specified at search time. So the tree building is done only once while the search can be performed multiple times with different approximation levels.