TY - JOUR
T1 - Joint Feature Selection and Extraction With Sparse Unsupervised Projection
AU - Wang, Jingyu
AU - Wang, Lin
AU - Nie, Feiping
AU - Li, Xuelong
N1 - Publisher Copyright:
© 2012 IEEE.
PY - 2023/6/1
Y1 - 2023/6/1
N2 - Feature selection and feature extraction, in the field of data dimensionality reduction, are the two main strategies. Nevertheless, each of these two strategies has its own advantages and disadvantages. The features chosen by feature selection method have complete physical meaning. However, feature selection cannot reveal the implicit structural information of the samples. In this article, the methods proposed by us combine both feature selection and feature extraction, called joint feature selection and extraction with sparse unsupervised projection (SUP) and graph optimization SUP (GOSUP). A constraint on the number of nonzero rows of the projection matrix is added, which ensures the sparsity of the projection matrix, and only the features corresponding to the nonzero rows of the projection matrix are selected for the feature extraction procedure. We invoke a newly proposed algorithm to tackle this constrained optimization problem. A new concept of 'purification matrix' is invented, the use of which could better eliminate meaningless information of samples in subspace. The performance on several datasets verifies the effectiveness of the proposed method for data dimensionality reduction.
AB - Feature selection and feature extraction, in the field of data dimensionality reduction, are the two main strategies. Nevertheless, each of these two strategies has its own advantages and disadvantages. The features chosen by feature selection method have complete physical meaning. However, feature selection cannot reveal the implicit structural information of the samples. In this article, the methods proposed by us combine both feature selection and feature extraction, called joint feature selection and extraction with sparse unsupervised projection (SUP) and graph optimization SUP (GOSUP). A constraint on the number of nonzero rows of the projection matrix is added, which ensures the sparsity of the projection matrix, and only the features corresponding to the nonzero rows of the projection matrix are selected for the feature extraction procedure. We invoke a newly proposed algorithm to tackle this constrained optimization problem. A new concept of 'purification matrix' is invented, the use of which could better eliminate meaningless information of samples in subspace. The performance on several datasets verifies the effectiveness of the proposed method for data dimensionality reduction.
KW - Dimensionality reduction
KW - feature extraction
KW - feature selection
KW - graph optimization
KW - unsupervised learning
UR - http://www.scopus.com/inward/record.url?scp=85115713085&partnerID=8YFLogxK
U2 - 10.1109/TNNLS.2021.3111714
DO - 10.1109/TNNLS.2021.3111714
M3 - 文章
C2 - 34546929
AN - SCOPUS:85115713085
SN - 2162-237X
VL - 34
SP - 3071
EP - 3081
JO - IEEE Transactions on Neural Networks and Learning Systems
JF - IEEE Transactions on Neural Networks and Learning Systems
IS - 6
ER -