Sparse preserving feature weights learning

Guangsheng Xia

doi:10.1016/j.neucom.2015.12.020

Sparse preserving feature weights learning

2016-04-01

0

OA

AI

DOI：10.1016/j.neucom.2015.12.020

Original

Save

View PDF

Abstract

En 中文

In this paper, we propose a novel unsupervised feature selection algorithm, named sparse preserving feature weights learning (SPFW), which is based on the recent local data representation theory, sparse representation. SPFW differs from traditional feature selection algorithms in two aspects: (1) SPFW is designed on the locality measurement criterion with sparse reconstruction residual minimization. It adaptively determines the locality based on sparse representation, instead of fixing the k-nearest neighbors in the original feature space. (2) SPFW selects the most discriminative feature subset from the whole feature set in batch mode, instead of selecting features individually. To optimize the proposed formulation, we propose an efficient iterative algorithm, where each iteration reduces to a subproblem which can be solved with some off-the-shelf toolboxes. We conduct experiments on two face datasets to evaluate the performance of feature selection in terms of classification and clustering, which demonstrate the effectiveness of the proposed algorithm. (C) 2015 Elsevier B.V. All rights reserved.

Keywords:

Joint feature selection

Sparse representation

Feature weights learning

Sparse preserving feature weights learning

Abstract

AI Summary

Journal

Organization