.png){kind=icon}
返回
Sparse discriminative feature weights learning
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2015.09.065.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Sparse representation, a locality-based data representation method, leads to promising results in many scientific and engineering fields. Meanwhile in the study of feature selection, locality preserving is widely recognized as an effective measurement criterion. In this paper, we introduce l(1)-norm driven sparse representation into feature selection, and propose a novel joint feature weights learning algorithm, named sparse discriminative feature weights (SDFW). SDFW assigns the highest score to the feature that has the smallest difference between within-class reconstruction residual and between-class reconstruction residual in the space of selected features. It possesses the following advantages: (1) compared with feature selection methods based on k nearest neighbors, SDFX/V automatically (vs. manually) determines neighborhood for individual sample; (2) compared with conventional heuristic feature search which selects features individually, SDFW selects feature subset in batch mode. Extensive experiments on different data types demonstrate the effectiveness of SDFW. (C) 2015 Elsevier B.V. All rights reserved.
Keyword:
Feature weights leaning
Sparse representation based classification
Discriminant learning
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
暂无机构信息
引用论文
Bayesian approach to feature selection and parameter tuning for support vector machine classifiers.png)
NEURAL NETWORKS
OAAI
NEURAL NETWORKSIF6.3
OAAI分享收藏Quantitative approach to hückel rule the relations between the cycles of a molecular graph and the thermodynamic stability of a conjugated moleculeTetrahedron
TetrahedronIF0
PREAI
分享收藏分享收藏A novel neural dynamical approach to convex quadratic program and its efficient applicationsNEURAL NETWORKS
NEURAL NETWORKSIF6.3
PREAI
分享收藏
查看更多内容