|
template<typename TreeType , typename ElemType > |
static bool | CheckLeafSweep (const TreeType *node, const size_t cutAxis, const ElemType cut) |
| Check if a leaf node can be split along the axis at the provided coordinate. More...
|
|
template<typename TreeType , typename ElemType > |
static bool | CheckNonLeafSweep (const TreeType *node, const size_t cutAxis, const ElemType cut) |
| Check if an intermediate node can be split along the axis at the provided coordinate. More...
|
|
template<typename TreeType > |
static TreeType::ElemType | SweepLeafNode (const size_t axis, const TreeType *node, typename TreeType::ElemType &axisCut) |
| Find a suitable partition of a leaf node along the provided axis. More...
|
|
template<typename TreeType > |
static TreeType::ElemType | SweepNonLeafNode (const size_t axis, const TreeType *node, typename TreeType::ElemType &axisCut) |
| Find a suitable partition of a non-leaf node along the provided axis. More...
|
|
template<typename SplitPolicy>
class mlpack::tree::MinimalCoverageSweep< SplitPolicy >
The MinimalCoverageSweep class finds a partition along which we can split a node according to the coverage of two resulting nodes.
The class finds a partition along a given axis. Moreover, the class evaluates the cost of each split. The cost is proportional to the total coverage of resulting nodes. If the resulting nodes are overflowed the maximum cost is returned.
- Template Parameters
-
SplitPolicy | The class that provides rules for inserting children of a node that is being split into two new subtrees. |
Definition at line 30 of file minimal_coverage_sweep.hpp.