Feature selection and multi-kernel learning for sparse representation on a manifold

Jim Jing-Yan Wang, Halima Bensmail, Xin Gao

Research output: Contribution to journalArticlepeer-review

55 Scopus citations


Sparse representation has been widely studied as a part-based data representation method and applied in many scientific and engineering fields, such as bioinformatics and medical imaging. It seeks to represent a data sample as a sparse linear combination of some basic items in a dictionary. Gao etal. (2013) recently proposed Laplacian sparse coding by regularizing the sparse codes with an affinity graph. However, due to the noisy features and nonlinear distribution of the data samples, the affinity graph constructed directly from the original feature space is not necessarily a reliable reflection of the intrinsic manifold of the data samples. To overcome this problem, we integrate feature selection and multiple kernel learning into the sparse coding on the manifold. To this end, unified objectives are defined for feature selection, multiple kernel learning, sparse coding, and graph regularization. By optimizing the objective functions iteratively, we develop novel data representation algorithms with feature selection and multiple kernel learning respectively. Experimental results on two challenging tasks, N-linked glycosylation prediction and mammogram retrieval, demonstrate that the proposed algorithms outperform the traditional sparse coding methods. © 2013 Elsevier Ltd.
Original languageEnglish (US)
Pages (from-to)9-16
Number of pages8
JournalNeural Networks
StatePublished - Mar 2014

ASJC Scopus subject areas

  • Artificial Intelligence
  • Cognitive Neuroscience


Dive into the research topics of 'Feature selection and multi-kernel learning for sparse representation on a manifold'. Together they form a unique fingerprint.

Cite this