Sparsity preserving score for joint feature selection

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Based on recent advances in sparse representation technique, we propose in this paper Sparsity Preserving Score (SPS) to jointly select features. SPS evaluates the importance of a feature by its power of sparse reconstructive relationship preserving, which is achieved by minimizing an objective function with l 1-norm regularization and binary constrain. Our searching strategy, which is an essentially discrete optimization, jointly selects features by projecting the original high-dimensional data to a low-dimensional space through a special binary projection matrix. Theoretical analysis guarantees our objective function can get a closed form solution, which is as simple as scoring each feature by Frobenius norm of sparse linear reconstruction residual for each feature. Comparing experiments on two face datasets are carried out. The experimental results demonstrate the effectiveness and efficiency of our algorithm. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Yan, H. (2013). Sparsity preserving score for joint feature selection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8261 LNCS, pp. 635–641). Springer Verlag. https://doi.org/10.1007/978-3-642-42057-3_80

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free