Effective Discriminative Feature Selection with Non-trivial Solutions
Not on the map. Why?
Abstract (arXiv)
Feature selection and feature transformation, the two main ways to reduce dimensionality, are often presented separately. In this paper, a feature selection method is proposed by combining the popular transformation based dimensionality reduction method Linear Discriminant Analysis (LDA) and sparsity regularization. We impose row sparsity on the transformation matrix of LDA through ℓ2,1-norm regularization to achieve feature selection, and the resultant formulation optimizes for selecting the most discriminative features and removing the redundant ones simultaneously. The formulation is extended to the ℓ2,p-norm regularized case: which is more likely to offer better sparsity when 0<p<1. Thus the formulation is a better approximation to the feature selection problem. An efficient algorithm is developed to solve the ℓ2,p-norm based optimization problem and it is proved that the algorithm converges when 0<p≤ 2. Systematical experiments are conducted to understand the work of the proposed method. Promising experimental results on various types of real-world data sets demonstrate the effectiveness of our algorithm.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 21 Apr 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 0; 2025: 1.
3 papers.
- 2025A supervised discriminant data representation: application to pattern classification24 Oct 2025
- 2023Take 5: Interpretable Image Classification with a Handful of Features23 Mar 2023
- 2022C2IMUFS: Complementary and Consensus Learning-based Incomplete Multi-view Unsupervised Feature Selection20 Aug 2022