Go to the source code of this file.
Namespaces | |
mlpack | |
Linear algebra utility functions, generally performed on matrices or vectors. | |
mlpack::neighbor | |
Typedefs | |
template < template < typename TreeMetricType , typename TreeStatType , typename TreeMatType > class TreeType = tree::SPTree > | |
using | DefeatistKNN = NeighborSearch< NearestNeighborSort, metric::EuclideanDistance, arma::mat, TreeType, TreeType< metric::EuclideanDistance, NeighborSearchStat< NearestNeighborSort >, arma::mat >::template DefeatistDualTreeTraverser, TreeType< metric::EuclideanDistance, NeighborSearchStat< NearestNeighborSort >, arma::mat >::template DefeatistSingleTreeTraverser > |
The DefeatistKNN class is the k-nearest-neighbors method considering defeatist search. More... | |
typedef NeighborSearch< FurthestNeighborSort, metric::EuclideanDistance > | KFN |
The KFN class is the k-furthest-neighbors method. More... | |
typedef NeighborSearch< NearestNeighborSort, metric::EuclideanDistance > | KNN |
The KNN class is the k-nearest-neighbors method. More... | |
typedef DefeatistKNN< tree::SPTree > | SpillKNN |
The SpillKNN class is the k-nearest-neighbors method considering defeatist search on SPTree. More... | |
Simple typedefs describing template instantiations of the NeighborSearch class which are commonly used. This is meant to be included by neighbor_search.h but is a separate file for simplicity.
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 typedef.hpp.