.png){kind=icon}
返回
Regularization and variable selection via the elastic net
.png){kind=icon}
OA
AI
DOI：10.1111/j.1467-9868.2005.00503.x.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose the elastic net, a new regularization and variable selection method. Real world data and a simulation study show that the elastic net often outperforms the lasso, while enjoying a similar sparsity of representation. In addition, the elastic net encourages a grouping effect, where strongly correlated predictors tend to be in or out of the model together. The elastic net is particularly useful when the number of predictors (p) is much bigger than the number of observations (n). By contrast, the lasso is not a very satisfactory variable selection method in the p>n case. An algorithm called LARS-EN is proposed for computing elastic net regularization paths efficiently, much like algorithm LARS does for the lasso.
Keyword:
grouping effect
LARS algorithm
Lasso
penalization
p >> n problem
variable selection
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
J
IF:
3.6
论文数:
1.5K
被引数:
3.2W
机构
暂无机构信息
引用论文
Significance analysis of microarrays applied to the ionizing radiation response微阵列应用于电离辐射响应的意义分析OAAI
OAAI分享收藏
分享收藏分享收藏Gene selection for cancer classification using support vector machines使用支持向量机进行癌症分类的基因选择.png)
MACHINE LEARNINGOAAI
MACHINE LEARNINGIF2.9
OAAI分享收藏
查看更多内容