Laplacian regularized low-rank representation for cancer samples clustering. (February 2019)

• Record Type: Journal Article
• Authors: Wang, Juan; Liu, Jin-Xing; Kong, Xiang-Zhen; Yuan, Sha-Sha; Dai, Ling-Yun
• Is Part Of: Computational biology and chemistry. Volume 78(2019)
• Page Start: 504
• Page End: 509
• Publication Date: 2019-02
• Subjects: Gene expression data -- Graph regularization -- Low-rank representation -- Affinity matrix -- Subspace clustering; Chemistry -- Data processing -- Periodicals; Biology -- Data processing -- Periodicals; Biochemistry -- Data processing; Biology -- Data processing; Molecular biology -- Data processing; Periodicals; Electronic journals; 542.85
• DOI: 10.1016/j.compbiolchem.2018.11.003
• Languages: English
• ISSNs: 1476-9271

Abstract

Abstract: Cancer samples clustering based on biomolecular data has been becoming an important tool for cancer classification. The recognition of cancer types is of great importance for cancer treatment. In this paper, in order to improve the accuracy of cancer recognition, we propose to use Laplacian regularized Low-Rank Representation (LLRR) to cluster the cancer samples based on genomic data. In LLRR method, the high-dimensional genomic data are approximately treated as samples extracted from a combination of several low-rank subspaces. The purpose of LLRR method is to seek the lowest-rank representation matrix based on a dictionary. Because a Laplacian regularization based on manifold is introduced into LLRR, compared to the Low-Rank Representation (LRR) method, besides capturing the global geometric structure, LLRR can capture the intrinsic local structure of high-dimensional observation data well. And what is more, in LLRR, the original data themselves are selected as a dictionary, so the lowest-rank representation is actually a similar expression between the samples. Therefore, corresponding to the low-rank representation matrix, the samples with high similarity are considered to come from the same subspace and are grouped into a class. The experiment results on real genomic data illustrate that LLRR method, compared with LRR and MLLRR, is more robust to noise and has a better ability to learn the inherent subspace structure of data, and achieves remarkable performance in the clustering of cancer samples.