mlpack
|
#include <mlpack/core/tree/binary_space_tree.hpp>
#include <mlpack/core/tree/cover_tree.hpp>
#include <mlpack/core/tree/rectangle_tree.hpp>
#include <mlpack/core/tree/spill_tree.hpp>
#include <mlpack/core/tree/octree.hpp>
#include "neighbor_search.hpp"
#include "ns_model_impl.hpp"
Go to the source code of this file.
Classes | |
class | mlpack::neighbor::NSWrapperBase |
NSWrapperBase is a base wrapper class for holding all NeighborSearch types supported by NSModel. More... | |
class | mlpack::neighbor::NSWrapper< SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType > |
NSWrapper is a wrapper class for most NeighborSearch types. More... | |
class | mlpack::neighbor::LeafSizeNSWrapper< SortPolicy, TreeType, DualTreeTraversalType, SingleTreeTraversalType > |
LeafSizeNSWrapper wraps any NeighborSearch types that take a leaf size for tree construction. More... | |
class | mlpack::neighbor::SpillNSWrapper< SortPolicy > |
The SpillNSWrapper class wraps the NeighborSearch class when the spill tree is used. More... | |
class | mlpack::neighbor::NSModel< SortPolicy > |
The NSModel class provides an easy way to serialize a model, abstracts away the different types of trees, and also reflects the NeighborSearch API. More... | |
Namespaces | |
mlpack | |
Linear algebra utility functions, generally performed on matrices or vectors. | |
This is a model for nearest or furthest neighbor search. It is useful in that it provides an easy way to serialize a model, abstracts away the different types of trees, and also (roughly) reflects the NeighborSearch API and automatically directs to the right tree type. It is meant to be used by the knn and kfn bindings.
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.