Go to the source code of this file.
|
| 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...
|
| |