7 #ifndef MLPACK_METHODS_DECISION_TREE_BEST_BINARY_NUMERIC_SPLIT_HPP 8 #define MLPACK_METHODS_DECISION_TREE_BEST_BINARY_NUMERIC_SPLIT_HPP 21 template<
typename FitnessFunction>
26 template<
typename ElemType>
48 template<
typename VecType>
50 const double bestGain,
52 const arma::Row<size_t>& labels,
53 const size_t numClasses,
54 const size_t minimumLeafSize,
55 arma::Col<typename VecType::elem_type>& classProbabilities,
61 template<
typename ElemType>
75 template<
typename ElemType>
77 const ElemType& point,
78 const arma::Col<ElemType>& classProbabilities,
86 #include "best_binary_numeric_split_impl.hpp" static double SplitIfBetter(const double bestGain, const VecType &data, const arma::Row< size_t > &labels, const size_t numClasses, const size_t minimumLeafSize, arma::Col< typename VecType::elem_type > &classProbabilities, AuxiliarySplitInfo< typename VecType::elem_type > &aux)
Check if we can split a node.
The BestBinaryNumericSplit is a splitting function for decision trees that will exhaustively search a...
Linear algebra utility functions, generally performed on matrices or vectors.
static size_t NumChildren(const arma::Col< ElemType > &, const AuxiliarySplitInfo< ElemType > &)
Returns 2, since the binary split always has two children.
The core includes that mlpack expects; standard C++ includes and Armadillo.
static size_t CalculateDirection(const ElemType &point, const arma::Col< ElemType > &classProbabilities, const AuxiliarySplitInfo< ElemType > &)
Given a point, calculate which child it should go to (left or right).