Unsupervised feature selection regression model with nonnegative sparsity constraints

• Published in: Journal of intelligent & fuzzy systems Vol. 45; no. 1; pp. 637 - 648
• Main Authors: Zhao, Xue, Li, Qiaoyan, Xing, Zhiwei, Dai, Xuezhen
• Format: Journal Article
• Language: English
• Published: London, England SAGE Publications 01.01.2023; Sage Publications Ltd
• Subjects: Algorithms; Clustering; Constraint modelling; Feature selection; Labels; Matrices (mathematics); Optimization; Regression models; Sparsity; Unsupervised learning; Non-negative matrix factorization; unsupervised; feature selection; spectral clustering; L2,1-norm
• DOI: 10.3233/JIFS-224132
• ISSN: 1064-1246

Selecting appropriate features can better describe the characteristics and structure of data, which play an important role in further improving models and algorithms whether for supervised or unsupervised learning. In this paper, a new unsupervised feature selection regression model with nonnegative sparse constraints (URNS) is proposed. The algorithm combines nonnegative orthogonal constraint, L2,1-norm minimum optimization and spectral clustering. Firstly, the linear regression model between the features and the pseudo labels is given, and the indicator matrix, which describes feature weight, is subject to nonnegative and orthogonal constraints to select better features. Secondly, in order to reduce redundant and even noisy features, L2,1-norm for indicator matrix is added to the regression model for exploring the correlation between pseudo labels and features by the row sparsity property of L2,1-norm. Finally, pseudo labels of all samples are established by spectral clustering. In order to solve the regression model efficiently and simply, the method of nonnegative matrix decomposition is used and the complexity of the given algorithm is analysed. Moreover, a large number of experiments and analyses have been carried out on several public datasets to verify the superiority of the given model.