Name
Abstract | ||
|---|---|---|
Lasso-type variable selection has been demonstrated to be effective in handling high-dimensional data. From the biological perspective, traditional Lasso-type models are capable of learning which stimuli are valuable while ignoring the many that are not, and thus perform feature selection. Traditional Lasso has the tendency to over-emphasize sparsity and to overlook the correlations between features. These drawbacks have been demonstrated to be critical in limiting its performance on real-world feature selection problems. Although some work has considered the problem of correlation, the issue of discriminative ability resulting from sparsity has been overlooked. To overcome this shortcoming, we propose a discriminative Lasso (referred to as dLasso) in which sparsity and correlation are jointly considered. Specifically, the new method can select features (or stimuli) that are correlated more strongly with the response but are less correlated with each other. Moreover, an efficient alternating direction method of multipliers (ADMM) is presented to solve the resulting sparse non-convex optimization problem. Extensive experiments on different datasets show that although our proposed model is not a convex problem, it outperforms both its approximately convex counterparts and a number of state-of-the-art feature selection methods. |
Year | DOI | Venue |
|---|---|---|
2016 | https://doi.org/10.1007/s12559-016-9402-z | Cognitive Computation |
Keywords | DocType | Volume |
Lasso,Feature selection,Feature graph,ADMM | Journal | 8 |
Issue | Citations | PageRank |
5 | 0 | 0.34 |
References | Authors | |
0 | 7 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhihong Zhang | 1 | 100 | 15.85 |
| Jianbing Xiahou | 2 | 25 | 5.42 |
| Zheng-Jian Bai | 3 | 92 | 13.70 |
| Edwin R. Hancock | 4 | 10 | 8.70 |
| Da Zhou | 5 | 0 | 1.01 |
| Sibao Chen | 6 | 127 | 13.42 |
| Liyan Chen | 7 | 1 | 1.71 |