18 #ifndef MLPACK_CORE_TREE_SPILL_TREE_SPILL_DUAL_TREE_TRAVERSER_HPP 19 #define MLPACK_CORE_TREE_SPILL_TREE_SPILL_DUAL_TREE_TRAVERSER_HPP 28 template<
typename MetricType,
29 typename StatisticType,
31 template<
typename HyperplaneMetricType>
class HyperplaneType,
32 template<
typename SplitMetricType,
typename SplitMatType>
34 template<
typename RuleType,
bool Defeatist>
35 class SpillTree<MetricType, StatisticType, MatType, HyperplaneType, SplitType>::
54 const bool bruteForce =
false);
94 typename RuleType::TraversalInfoType traversalInfo;
101 #include "spill_dual_tree_traverser_impl.hpp" 103 #endif // MLPACK_CORE_TREE_SPILL_TREE_SPILL_DUAL_TREE_TRAVERSER_HPP size_t & NumScores()
Modify the number of times a node combination was scored.
Linear algebra utility functions, generally performed on matrices or vectors.
The core includes that mlpack expects; standard C++ includes and Armadillo.
size_t NumVisited() const
Get the number of visited combinations.
A hybrid spill tree is a variant of binary space trees in which the children of a node can "spill ove...
A generic dual-tree traverser for hybrid spill trees; see spill_dual_tree_traverser.hpp for implementation.
size_t & NumVisited()
Modify the number of visited combinations.
size_t NumPrunes() const
Get the number of prunes.
size_t & NumBaseCases()
Modify the number of times a base case was calculated.
size_t & NumPrunes()
Modify the number of prunes.
size_t NumScores() const
Get the number of times a node combination was scored.
Definition of generalized hybrid spill tree (SpillTree).
size_t NumBaseCases() const
Get the number of times a base case was calculated.