Component-wisely sparse boosting
type: Item
instance of: scholarly article
title: Component-wisely sparse boosting
zbMATH Open document ID: 1296.62064
author: D. Kharzeev
published in: Journal of the Korean Statistical Society
publication date: 2014-09-30T00:00:00Z
Mathematics Subject Classification ID: 62F35
Mathematics Subject Classification ID: 62F07
zbMATH DE Number: 6350103
zbMATH Keywords: boosting
zbMATH Keywords: generalized additive model
zbMATH Keywords: sparsity
zbMATH Keywords: smoothly clipped absolute deviation
MaRDI profile type: Publication
full work available at URL: j.jkss.2011.08.005
OpenAlex ID: W2073265045
cites work: Prediction Games and Arcing Algorithms
cites work: Q3093379
cites work: Least angle regression. (With discussion)
cites work: Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
cites work: A decision-theoretic generalization of on-line learning and an application to boosting
cites work: Greedy function approximation: A gradient boosting machine.
cites work: Generalized additive models. With discussion
cites work: Smoothly Clipped Absolute Deviation on High Dimensions
cites work: Boosting on the functional ANOVA decomposition
cites work: On the Bayes-risk consistency of regularized boosting methods.
cites work: Relaxed Lasso
cites work: Improved boosting algorithms using confidence-rated predictions
cites work: Q4864293
cites work: Nearly unbiased variable selection under minimax concave penalty
DOI: 10.1016/J.JKSS.2011.08.005
description: scientific article; zbMATH DE number 6350103