Go to the source code of this file.
|
| | mlpack |
| | Linear algebra utility functions, generally performed on matrices or vectors.
|
| |
| | mlpack::neighbor |
| | Neighbor-search routines.
|
| |
|
| typedef NeighborSearch< FurthestNeighborSort, metric::EuclideanDistance > | mlpack::neighbor::AllkFN |
| |
| typedef NeighborSearch< NearestNeighborSort, metric::EuclideanDistance > | mlpack::neighbor::AllkNN |
| |
| template<template< typename TreeMetricType, typename TreeStatType, typename TreeMatType > class TreeType = tree::SPTree> |
| using | mlpack::neighbor::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 > | mlpack::neighbor::KFN |
| | The KFN class is the k-furthest-neighbors method. More...
|
| |
| typedef NeighborSearch< NearestNeighborSort, metric::EuclideanDistance > | mlpack::neighbor::KNN |
| | The KNN class is the k-nearest-neighbors method. More...
|
| |
| typedef DefeatistKNN< tree::SPTree > | mlpack::neighbor::SpillKNN |
| | The SpillKNN class is the k-nearest-neighbors method considering defeatist search on SPTree. More...
|
| |