mlpack
typedef.hpp
Go to the documentation of this file.
1 
13 #ifndef MLPACK_CORE_TREE_BINARY_SPACE_TREE_TYPEDEF_HPP
14 #define MLPACK_CORE_TREE_BINARY_SPACE_TREE_TYPEDEF_HPP
15 
16 // In case it hasn't been included yet.
17 #include "../binary_space_tree.hpp"
18 
19 namespace mlpack {
20 namespace tree {
21 
58 template<typename MetricType, typename StatisticType, typename MatType>
59 using KDTree = BinarySpaceTree<MetricType,
60  StatisticType,
61  MatType,
62  bound::HRectBound,
63  MidpointSplit>;
64 
75 template<typename MetricType, typename StatisticType, typename MatType>
76 using MeanSplitKDTree = BinarySpaceTree<MetricType,
77  StatisticType,
78  MatType,
79  bound::HRectBound,
80  MeanSplit>;
81 
107 template<typename MetricType, typename StatisticType, typename MatType>
108 using BallTree = BinarySpaceTree<MetricType,
109  StatisticType,
110  MatType,
111  bound::BallBound,
112  MidpointSplit>;
113 
136 template<typename MetricType, typename StatisticType, typename MatType>
137 using MeanSplitBallTree = BinarySpaceTree<MetricType,
138  StatisticType,
139  MatType,
140  bound::BallBound,
141  MeanSplit>;
142 
190 template<typename BoundType,
191  typename MatType = arma::mat>
192 using VPTreeSplit = VantagePointSplit<BoundType, MatType, 100>;
193 
194 template<typename MetricType, typename StatisticType, typename MatType>
195 using VPTree = BinarySpaceTree<MetricType,
196  StatisticType,
197  MatType,
198  bound::HollowBallBound,
199  VPTreeSplit>;
200 
227 template<typename MetricType, typename StatisticType, typename MatType>
228 using MaxRPTree = BinarySpaceTree<MetricType,
229  StatisticType,
230  MatType,
231  bound::HRectBound,
232  RPTreeMaxSplit>;
233 
261 template<typename MetricType, typename StatisticType, typename MatType>
262 using RPTree = BinarySpaceTree<MetricType,
263  StatisticType,
264  MatType,
265  bound::HRectBound,
266  RPTreeMeanSplit>;
267 
296 template<typename MetricType, typename StatisticType, typename MatType>
297 using UBTree = BinarySpaceTree<MetricType,
298  StatisticType,
299  MatType,
300  bound::CellBound,
301  UBTreeSplit>;
302 
303 } // namespace tree
304 } // namespace mlpack
305 
306 #endif
mlpack
Linear algebra utility functions, generally performed on matrices or vectors.
Definition: add_to_cli11.hpp:21
mlpack::bound::CellBound
The CellBound class describes a bound that consists of a number of hyperrectangles.
Definition: cellbound.hpp:75
mlpack::tree::RPTreeMaxSplit
This class splits a node by a random hyperplane.
Definition: rp_tree_max_split.hpp:32
mlpack::tree::BinarySpaceTree
A binary space partitioning tree, such as a KD-tree or a ball tree.
Definition: binary_space_tree.hpp:54
mlpack::bound::BallBound
Ball bound encloses a set of points at a specific distance (radius) from a specific point (center)...
Definition: ballbound.hpp:32
mlpack::tree::MidpointSplit
A binary space partitioning tree node is split into its left and right child.
Definition: midpoint_split.hpp:30
mlpack::tree::UBTreeSplit
Split a node into two parts according to the median address of points contained in the node...
Definition: ub_tree_split.hpp:29
mlpack::tree::VantagePointSplit
The class splits a binary space partitioning tree node according to the median distance to the vantag...
Definition: vantage_point_split.hpp:32
mlpack::tree::RPTreeMeanSplit
This class splits a binary space tree.
Definition: rp_tree_mean_split.hpp:33
mlpack::tree::MeanSplit
A binary space partitioning tree node is split into its left and right child.
Definition: mean_split.hpp:29
mlpack::tree::KDTree
BinarySpaceTree< MetricType, StatisticType, MatType, bound::HRectBound, MidpointSplit > KDTree
The standard midpoint-split kd-tree.
Definition: typedef.hpp:63
mlpack::bound::HollowBallBound
Hollow ball bound encloses a set of points at a specific distance (radius) from a specific point (cen...
Definition: hollow_ball_bound.hpp:33