mlpack  3.4.2
typedef.hpp
Go to the documentation of this file.
1 
14 #ifndef MLPACK_NEIGHBOR_SEARCH_TYPEDEF_H
15 #define MLPACK_NEIGHBOR_SEARCH_TYPEDEF_H
16 
17 // In case someone included this directly.
18 #include "neighbor_search.hpp"
19 
21 
24 
25 namespace mlpack {
26 namespace neighbor {
27 
33 
39 
47 template<template<typename TreeMetricType,
48  typename TreeStatType,
49  typename TreeMatType> class TreeType = tree::SPTree>
53  arma::mat,
54  TreeType,
57  arma::mat>::template DefeatistDualTreeTraverser,
60  arma::mat>::template DefeatistSingleTreeTraverser>;
61 
68 
69 } // namespace neighbor
70 } // namespace mlpack
71 
72 #endif
mlpack::neighbor::KFN
NeighborSearch< FurthestNeighborSort, metric::EuclideanDistance > KFN
The KFN class is the k-furthest-neighbors method.
Definition: typedef.hpp:38
nearest_neighbor_sort.hpp
mlpack::neighbor::SpillKNN
DefeatistKNN< tree::SPTree > SpillKNN
The SpillKNN class is the k-nearest-neighbors method considering defeatist search on SPTree.
Definition: typedef.hpp:67
lmetric.hpp
neighbor_search.hpp
mlpack::neighbor::KNN
NeighborSearch< NearestNeighborSort, metric::EuclideanDistance > KNN
The KNN class is the k-nearest-neighbors method.
Definition: typedef.hpp:32
mlpack::neighbor::NeighborSearchStat
Extra data for each node in the tree.
Definition: neighbor_search_stat.hpp:27
mlpack
Linear algebra utility functions, generally performed on matrices or vectors.
Definition: add_to_cli11.hpp:21
mlpack::neighbor::NearestNeighborSort
NearestNS NearestNeighborSort
Definition: nearest_neighbor_sort.hpp:200
mlpack::neighbor::NeighborSearch
The NeighborSearch class is a template class for performing distance-based neighbor searches.
Definition: neighbor_search.hpp:84
mlpack::metric::EuclideanDistance
LMetric< 2, true > EuclideanDistance
The Euclidean (L2) distance.
Definition: lmetric.hpp:112
furthest_neighbor_sort.hpp
mlpack::tree::SpillTree
A hybrid spill tree is a variant of binary space trees in which the children of a node can "spill ove...
Definition: spill_tree.hpp:74