Abstract
Feature selection has been widely used in machine learning for a long time. In this paper, we propose a supervised local sparse discriminative feature selection method named LSDFS to obtain sparse features by imposing ℓ2,0-norm constraint on transformation matrix. Differently from traditional approaches, our method does not require approximation or relaxation schemes, such as ℓ2,p-norm to solve long-standing challenge. Our method is based on the trace difference form of Linear Discriminant Analysis (LDA), which can efficiently obtain discriminative information in low-dimensional space. In order to explore the local structure of data which contains more discriminative information, we adopt a sparse connections graph between anchor points and data points instead of fully-connected graph with time-consuming, and add a decay parameter to avoid trivial solutions, making the model more precisely. Extensive experiments conducted on synthetic datasets and several real-world datasets have demonstrated the advantages of our method.
| Original language | English |
|---|---|
| Article number | 120214 |
| Journal | Information Sciences |
| Volume | 662 |
| DOIs | |
| State | Published - Mar 2024 |
Keywords
- Local structure
- Sparse connection graph
- Supervised feature selection
- ℓ-norm constraint
Fingerprint
Dive into the research topics of 'Local sparse discriminative feature selection'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver