.png){kind=icon}
返回
Robust feature selection via simultaneous sapped norm and sparse regularizer minimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2017.12.055.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
High dimension is one of the key characters of big data. Feature selection, as a framework to identify a small subset of illustrative and discriminative features, has been proved as a basic solution in dealing with high-dimensional data. In previous literatures, l(2,p)-norm regularization was studied by many researches as an effective approach to select features across data sets with sparsity. However,l(2,p)-norm loss function is just robust to noise but not considering the influence of outliers. In this paper, we propose a new robust and efficient feature selection method with emphasizing Simultaneous Capped l(2)-norm loss and l(2,p)-norm regularizer Minimization (SCM). The capped l(2)-norm based loss function can effectively eliminate the influence of noise and outliers in regression and the l(2,p)-norm regularization is used to select features across data sets with joint sparsity. An efficient approach is then introduced with proved convergence. Extensive experimental studies on synthetic and real-world datasets demonstrate the effectiveness of our method in comparison with other popular feature selection methods. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Feature selection
Capped l(2)-norm loss
l(2,p)-norm regularization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
.png){kind=icon}
Helmholtz principle based supervised and unsupervised feature selection methods for text mining基于Helmholtz原理的监督和非监督文本挖掘特征选择方法
OAAI
OAAI分享收藏
查看更多内容