Recommendations
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A decision-theoretic generalization of on-line learning and an application to boosting
- Boosting on the functional ANOVA decomposition
- Generalized additive models. With discussion
- Greedy function approximation: A gradient boosting machine.
- Improved boosting algorithms using confidence-rated predictions
- Least angle regression. (With discussion)
- Nearly unbiased variable selection under minimax concave penalty
- On the Bayes-risk consistency of regularized boosting methods.
- Prediction Games and Arcing Algorithms
- Relaxed Lasso
- Smoothly clipped absolute deviation on high dimensions
- Sparse boosting
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(6)- Gradient boosting for high-dimensional prediction of rare events
- Probing for sparse and fast variable selection with model-based boosting
- General sparse boosting: improving feature selection of \(L_{2}\) boosting by correlation-based penalty family
- Boosting with structural sparsity: a differential inclusion approach
- Sparse boosting
- Wavelet-based gradient boosting
This page was built for publication: Component-wisely sparse boosting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q743775)