z-logo
open-access-imgOpen Access
Learning a Weighted Meta-Sample Based Parameter Free Sparse Representation Classification for Microarray Data
Author(s) -
Bo Liao,
Yan Jiang,
Guanqun Yuan,
Wen Zhu,
Liang Cai,
Zhi Cao
Publication year - 2014
Publication title -
plos one
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.99
H-Index - 332
ISSN - 1932-6203
DOI - 10.1371/journal.pone.0104314
Subject(s) - pattern recognition (psychology) , sparse approximation , computer science , underdetermined system , outlier , artificial intelligence , regularization (linguistics) , weighting , mathematics , data mining , algorithm , medicine , radiology
Sparse representation classification (SRC) is one of the most promising classification methods for supervised learning. This method can effectively exploit discriminating information by introducing aregularization 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 byregularization 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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here