TY - JOUR
T1 - Local sparse discriminative feature selection
AU - Zhang, Canyu
AU - Shi, Shaojun
AU - Chen, Yanping
AU - Nie, Feiping
AU - Wang, Rong
N1 - Publisher Copyright:
© 2024 Elsevier Inc.
PY - 2024/3
Y1 - 2024/3
N2 - 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.
AB - 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.
KW - Local structure
KW - Sparse connection graph
KW - Supervised feature selection
KW - ℓ-norm constraint
UR - http://www.scopus.com/inward/record.url?scp=85184146388&partnerID=8YFLogxK
U2 - 10.1016/j.ins.2024.120214
DO - 10.1016/j.ins.2024.120214
M3 - 文章
AN - SCOPUS:85184146388
SN - 0020-0255
VL - 662
JO - Information Sciences
JF - Information Sciences
M1 - 120214
ER -