minimal_coverage_sweep.hpp File Reference
Include dependency graph for minimal_coverage_sweep.hpp:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Classes | |
| class | MinimalCoverageSweep< SplitPolicy > |
| The MinimalCoverageSweep class finds a partition along which we can split a node according to the coverage of two resulting nodes. More... | |
| struct | MinimalCoverageSweep< SplitPolicy >::SweepCost< TreeType > |
| A struct that provides the type of the sweep cost. More... | |
Namespaces | |
| mlpack | |
Linear algebra utility functions, generally performed on matrices or vectors. | |
| mlpack::tree | |
Trees and tree-building procedures. | |
Detailed Description
Definition of the MinimalCoverageSweep class, a class that finds a partition of a node along an axis.
mlpack is free software; you may redistribute it and/or modify it under the terms of the 3-clause BSD license. You should have received a copy of the 3-clause BSD license along with mlpack. If not, see http://www.opensource.org/licenses/BSD-3-Clause for more information.
Definition in file minimal_coverage_sweep.hpp.