Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors.
Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors.
复制标题
DOI:
10.1007/s11222-013-9424-2
复制
发表时间:
2015-03
影响因子:
2.2
通讯作者:
Huang J
中科院分区:
文献类型:
--
作者:
Breheny P;Huang J
Penalized regression is an attractive framework for variable selection problems. Often, variables possess a grouping structure, and the relevant selection problem is that of selecting groups, not individual variables. The group lasso has been proposed as a way of extending the ideas of the lasso to the problem of group selection. Nonconvex penalties such as SCAD and MCP have been proposed and shown to have several advantages over the lasso; these penalties may also be extended to the group selection problem, giving rise to group SCAD and group MCP methods. Here, we describe algorithms for fitting these models stably and efficiently. In addition, we present simulation results and real data examples comparing and contrasting the statistical properties of these methods.
登录
查看更多内容
DOI:
10.1073/pnas.0600158103
发表时间:
2006-04-18
影响因子:
11.1
作者:
Chiang, AP;Beck, JS;Sheffield, VC
通讯作者:
Sheffield, VC
DOI:
10.1214/10-aoas388
发表时间:
2011-01-01
期刊:
The annals of applied statistics
影响因子:
--
作者:
Breheny P;Huang J
通讯作者:
Huang J
影响因子:
2.4
作者:
Lange, K;Hunter, DR;Yang, I
通讯作者:
Yang, I
影响因子:
4.5
作者:
Zhang, Cun-Hui
通讯作者:
Zhang, Cun-Hui
影响因子:
4.5
作者:
Zou, Hui;Li, Runze
通讯作者:
Li, Runze