Regularizing axis-aligned ensembles via data rotations that favor simpler learners
From MaRDI portal
Publication:2029102
DOI10.1007/s11222-020-09973-3zbMath1461.62013OpenAlexW3126012003MaRDI QIDQ2029102
Publication date: 3 June 2021
Published in: Statistics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11222-020-09973-3
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Greedy function approximation: A gradient boosting machine.
- Constructing optimal binary decision trees is NP-complete
- Random projections as regularizers: learning a linear discriminant from fewer observations than dimensions
- Generation of Random Orthogonal Matrices
- An Introduction to Statistical Learning
- Random-projection Ensemble Classification
- Fast Computation of Rotation-Invariant Image Features by an Approximate Radial Gradient Transform
- Random forests
This page was built for publication: Regularizing axis-aligned ensembles via data rotations that favor simpler learners