17 #ifndef __MLPACK_CORE_TREE_BINARY_SPACE_TREE_MIDPOINT_SPLIT_HPP 18 #define __MLPACK_CORE_TREE_BINARY_SPACE_TREE_MIDPOINT_SPLIT_HPP 30 template<
typename BoundType,
typename MatType = arma::mat>
48 static bool SplitNode(
const BoundType& bound,
70 static bool SplitNode(
const BoundType& bound,
75 std::vector<size_t>& oldFromNew);
93 const size_t splitDimension,
94 const double splitVal);
113 const size_t splitDimension,
114 const double splitVal,
115 std::vector<size_t>& oldFromNew);
122 #include "midpoint_split_impl.hpp" Linear algebra utility functions, generally performed on matrices or vectors.
A binary space partitioning tree node is split into its left and right child.
Include all of the base components required to write MLPACK methods, and the main MLPACK Doxygen docu...
static bool SplitNode(const BoundType &bound, MatType &data, const size_t begin, const size_t count, size_t &splitCol)
Split the node according to the mean value in the dimension with maximum width.
static size_t PerformSplit(MatType &data, const size_t begin, const size_t count, const size_t splitDimension, const double splitVal)
Reorder the dataset into two parts such that they lie on either side of splitCol. ...