Learning a weighted meta-sample based parameter free sparse representation classification for microarray data

14Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

Abstract

Sparse representation classification (SRC) is one of the most promising classification methods for supervised learning. This method can effectively exploit discriminating information by introducing a ℓ1 regularization terms to the data. With the desirable property of sparisty, SRC is robust to both noise and outliers. In this study, we propose a weighted meta-sample based non-parametric sparse representation classification method for the accurate identification of tumor subtype. The proposed method includes three steps. First, we extract the weighted meta-samples for each sub class from raw data, and the rationality of the weighting strategy is proven mathematically. Second, sparse representation coefficients can be obtained by ℓ1 regularization of underdetermined linear equations. Thus, data dependent sparsity can be adaptively tuned. A simple characteristic function is eventually utilized to achieve classification. Asymptotic time complexity analysis is applied to our method. Compared with some state-of-the-art classifiers, the proposed method has lower time complexity and more flexibility. Experiments on eight samples of publicly available gene expression profile data show the effectiveness of the proposed method. © 2014 Liao et al.

Cite

CITATION STYLE

APA

Liao, B., Jiang, Y., Yuan, G., Zhu, W., Cai, L., & Cao, Z. (2014). Learning a weighted meta-sample based parameter free sparse representation classification for microarray data. PLoS ONE, 9(8). https://doi.org/10.1371/journal.pone.0104314

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