TY - JOUR
T1 - Discriminative sparse coding on multi-manifolds
AU - Wang, Jim Jing-Yan
AU - Bensmail, H.
AU - Yao, N.
AU - Gao, Xin
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2013/9/26
Y1 - 2013/9/26
N2 - Sparse coding has been popularly used as an effective data representation method in various applications, such as computer vision, medical imaging and bioinformatics. However, the conventional sparse coding algorithms and their manifold-regularized variants (graph sparse coding and Laplacian sparse coding), learn codebooks and codes in an unsupervised manner and neglect class information that is available in the training set. To address this problem, we propose a novel discriminative sparse coding method based on multi-manifolds, that learns discriminative class-conditioned codebooks and sparse codes from both data feature spaces and class labels. First, the entire training set is partitioned into multiple manifolds according to the class labels. Then, we formulate the sparse coding as a manifold-manifold matching problem and learn class-conditioned codebooks and codes to maximize the manifold margins of different classes. Lastly, we present a data sample-manifold matching-based strategy to classify the unlabeled data samples. Experimental results on somatic mutations identification and breast tumor classification based on ultrasonic images demonstrate the efficacy of the proposed data representation and classification approach. 2013 The Authors. All rights reserved.
AB - Sparse coding has been popularly used as an effective data representation method in various applications, such as computer vision, medical imaging and bioinformatics. However, the conventional sparse coding algorithms and their manifold-regularized variants (graph sparse coding and Laplacian sparse coding), learn codebooks and codes in an unsupervised manner and neglect class information that is available in the training set. To address this problem, we propose a novel discriminative sparse coding method based on multi-manifolds, that learns discriminative class-conditioned codebooks and sparse codes from both data feature spaces and class labels. First, the entire training set is partitioned into multiple manifolds according to the class labels. Then, we formulate the sparse coding as a manifold-manifold matching problem and learn class-conditioned codebooks and codes to maximize the manifold margins of different classes. Lastly, we present a data sample-manifold matching-based strategy to classify the unlabeled data samples. Experimental results on somatic mutations identification and breast tumor classification based on ultrasonic images demonstrate the efficacy of the proposed data representation and classification approach. 2013 The Authors. All rights reserved.
UR - http://hdl.handle.net/10754/334545
UR - https://linkinghub.elsevier.com/retrieve/pii/S0950705113002827
UR - http://www.scopus.com/inward/record.url?scp=84901765974&partnerID=8YFLogxK
U2 - 10.1016/j.knosys.2013.09.004
DO - 10.1016/j.knosys.2013.09.004
M3 - Article
SN - 0950-7051
VL - 54
SP - 199
EP - 206
JO - Knowledge-Based Systems
JF - Knowledge-Based Systems
ER -