Learning ensembles of interpretable simple structure
From MaRDI portal
Cites work
- A decision-theoretic generalization of on-line learning and an application to boosting
- An Experiment with the Edited Nearest-Neighbor Rule
- Finding Groups in Data
- Greedy function approximation: A gradient boosting machine.
- scientific article; zbMATH DE number 1950578 (Why is no real title available?)
- Pattern recognition and machine learning.
This page was built for publication: Learning ensembles of interpretable simple structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6911316)