A novel low-rank hypergraph feature selection for multi-view classification

Xiaohui Cheng

doi:10.1016/j.neucom.2016.10.089

A novel low-rank hypergraph feature selection for multi-view classification

2017-08-01

22

PRE

AI

DOI：10.1016/j.neucom.2016.10.089

Original

Original request for help

Save

Abstract

En 中文

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 l(21)-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. (C) 2017 Elsevier B.V. All rights reserved.

Keywords:

High-dimensional data

Feature selection

Low-rank constraint

Sparse representation

Hypergraph

A novel low-rank hypergraph feature selection for multi-view classification

Abstract

AI Summary

Journal

Organization