Title
A novel low-rank hypergraph feature selection for multi-view classification.
Abstract
In order to select informative features from a high-dimensional multi-view dataset, we have proposed a feature selection method that simultaneously embedding the low-rank constraint, sparse representation, global and local structure learning into a unified framework. Firstly, we utilize the conventional regression function (i.e. the least square loss function) to form a novel regression framework by introducing a low-rank constraint and a relaxation term. And then we employ an l21-norm regularization term to filter out the redundant and irrelative features. Furthermore, we utilize a hypergraph based regularization term rather than the simple graph to construct a Laplacian matrix that will be used in enhancing the inherent association of data. Besides, we proposed a novel optimization algorithm to solve the objective function. Finally, we feed the reduced data got by the proposed feature selection method into Support Vector Machines (SVM) in term of classification accuracy. The experimental results showed that the proposed method achieved the best classification performance, compared with the state-of-the-art feature selection methods on real multi-view dataset.
Year
DOI
Venue
2017
10.1016/j.neucom.2016.10.089
Neurocomputing
Keywords
Field
DocType
High-dimensional data,Feature selection,Low-rank constraint,Sparse representation,Hypergraph
Laplacian matrix,Clustering high-dimensional data,Embedding,Feature selection,Pattern recognition,Sparse approximation,Support vector machine,Hypergraph,Regularization (mathematics),Artificial intelligence,Machine learning,Mathematics
Journal
Volume
Issue
ISSN
253
C
0925-2312
Citations 
PageRank 
References 
8
0.44
31
Authors
5
Name
Order
Citations
PageRank
Xiaohui Cheng1185.05
Yonghua Zhu221612.38
Jingkuan Song3197077.76
Guoqiu Wen4464.62
Wei He51246.44