TY - JOUR
T1 - 基于图嵌入的正交局部保持投影无监督特征选择
AU - Zhu, Jianyong
AU - Li, Zhaoxiang
AU - Xu, Bin
AU - Yang, Hui
AU - Nie, Feiping
N1 - Publisher Copyright:
© 2023 Editorial office of Computer Science. All rights reserved.
PY - 2023/11/16
Y1 - 2023/11/16
N2 - The traditional unsupervised feature selection algorithm based on graph learning often adopts sparse regularization method. However, this approach relies too heavily on the efficiency of graph learning, and it is not easy to tune regularization parameters. To solve this problem, an unsupervised feature selection algorithm based on graph embedding learning with orthogonal locality preserving projection is proposed in this paper. Firstly, we utilize locality preserving projection method to enhance the linear mapping ability that can maintain the local geometric manifold structure of the data, and orthogonal projection mode brings convenience to data reconstruction. Moreover, we use graph embedding learning method to quickly learn the similarity matrix of data. Then, l2.0-norm constrained projection matrix to select discriminative features. Finally, a new nonparametric algorithm is used to efficiently solve the model problem iteratively since l2.0-norm belongs to NP problem. Experimental results prove the effectiveness and superiority of the proposed algorithm.
AB - The traditional unsupervised feature selection algorithm based on graph learning often adopts sparse regularization method. However, this approach relies too heavily on the efficiency of graph learning, and it is not easy to tune regularization parameters. To solve this problem, an unsupervised feature selection algorithm based on graph embedding learning with orthogonal locality preserving projection is proposed in this paper. Firstly, we utilize locality preserving projection method to enhance the linear mapping ability that can maintain the local geometric manifold structure of the data, and orthogonal projection mode brings convenience to data reconstruction. Moreover, we use graph embedding learning method to quickly learn the similarity matrix of data. Then, l2.0-norm constrained projection matrix to select discriminative features. Finally, a new nonparametric algorithm is used to efficiently solve the model problem iteratively since l2.0-norm belongs to NP problem. Experimental results prove the effectiveness and superiority of the proposed algorithm.
KW - Graph embedding learning
KW - Nonparametric iterative algorithm
KW - Orthogonal locality preserving projection
KW - Unsupervised feature selection
KW - l_norm
UR - https://www.scopus.com/pages/publications/105019794463
U2 - 10.11896/jsjkx.220900003
DO - 10.11896/jsjkx.220900003
M3 - 文章
AN - SCOPUS:105019794463
SN - 1002-137X
VL - 50
JO - Computer Science
JF - Computer Science
IS - 11 A
M1 - 220900003
ER -