Estimating Latent Brain Sources with Low-Rank Representation and Graph Regularization

Author(s):  
Feng Liu ◽  
Shouyi Wang ◽  
Jing Qin ◽  
Yifei Lou ◽  
Jay Rosenberger
2018 ◽  
Vol 108 ◽  
pp. 83-96 ◽  
Author(s):  
Jie Wen ◽  
Xiaozhao Fang ◽  
Yong Xu ◽  
Chunwei Tian ◽  
Lunke Fei

2019 ◽  
Vol 20 (S22) ◽  
Author(s):  
Juan Wang ◽  
Cong-Hai Lu ◽  
Jin-Xing Liu ◽  
Ling-Yun Dai ◽  
Xiang-Zhen Kong

Abstract Background Identifying different types of cancer based on gene expression data has become hotspot in bioinformatics research. Clustering cancer gene expression data from multiple cancers to their own class is a significance solution. However, the characteristics of high-dimensional and small samples of gene expression data and the noise of the data make data mining and research difficult. Although there are many effective and feasible methods to deal with this problem, the possibility remains that these methods are flawed. Results In this paper, we propose the graph regularized low-rank representation under symmetric and sparse constraints (sgLRR) method in which we introduce graph regularization based on manifold learning and symmetric sparse constraints into the traditional low-rank representation (LRR). For the sgLRR method, by means of symmetric constraint and sparse constraint, the effect of raw data noise on low-rank representation is alleviated. Further, sgLRR method preserves the important intrinsic local geometrical structures of the raw data by introducing graph regularization. We apply this method to cluster multi-cancer samples based on gene expression data, which improves the clustering quality. First, the gene expression data are decomposed by sgLRR method. And, a lowest rank representation matrix is obtained, which is symmetric and sparse. Then, an affinity matrix is constructed to perform the multi-cancer sample clustering by using a spectral clustering algorithm, i.e., normalized cuts (Ncuts). Finally, the multi-cancer samples clustering is completed. Conclusions A series of comparative experiments demonstrate that the sgLRR method based on low rank representation has a great advantage and remarkable performance in the clustering of multi-cancer samples.


2015 ◽  
Vol 21 (6) ◽  
pp. 1569-1581 ◽  
Author(s):  
Wu He ◽  
Jim X. Chen ◽  
Weihua Zhang

2018 ◽  
Author(s):  
Feng Liu ◽  
Jay Rosenberger ◽  
Jing Qin ◽  
Yifei Lou ◽  
Shouyi Wang

AbstractTo infer brain source activation patterns under different cognitive tasks is an integral step to understand how our brain works. Traditional electroencephalogram (EEG) Source Imaging (ESI) methods usually do not distinguish task-related and spurious non-task-related sources that jointly generate EEG signals, which inevitably yield misleading reconstructed activation patterns. In this research, we argue that the task-related source signal intrinsically has a low-rank property, which is exploited to to infer the true task-related EEG sources location. Although the true task-related source signal is sparse and low-rank, the contribution of spurious sources scattering over the source space with intermittent activation patterns makes the actual source space lose the low-rank property. To reconstruct a low-rank true source, we propose a novel ESI model that involves a spatial low-rank representation and a temporal Laplacian graph regularization, the latter of which guarantees the temporal smoothness of the source signal and eliminate the spurious ones. To solve the proposed model, an augmented Lagrangian objective function is formulated and an algorithm in the framework of alternating direction method of multipliers is proposed. Numerical results illustrate the effectiveness of the proposed method in terms of reconstruction accuracy with high effciency.


2019 ◽  
Author(s):  
Na Yu ◽  
Jin-Xing Liu ◽  
Ying-Lian Gao ◽  
Chun-Hou Zheng ◽  
Junliang Shang ◽  
...  

AbstractThe development of single-cell RNA-sequencing (scRNA-seq) technology has enabled the measurement of gene expression in individual cells. This provides an unprecedented opportunity to explore the biological mechanisms at the cellular level. However, existing scRNA-seq analysis methods are susceptible to noise and outliers or ignore the manifold structure inherent in the data. In this paper, a novel method called Cauchy non-negative Laplacian regularized low-rank representation (CNLLRR) is proposed to alleviate the above problem. Specifically, we employ the Cauchy loss function (CLF) instead of the conventional norm constraints in the noise matrix of CNLLRR, which will enhance the robustness of the method. In addition, graph regularization term is applied to the objective function, which can capture the paired geometric relationships between cells. Then, alternating direction method of multipliers (ADMM) is adopted to solve the optimization problem of CNLLRR. Finally, extensive experiments on scRNA-seq data reveal that the proposed CNLLRR method outperforms other state-of-the-art methods for cell clustering, cell visualization and prioritization of gene markers. CNLLRR contributes to understand the heterogeneity between cell populations in complex biological systems.Author summaryAnalysis of single-cell data can help to further study the heterogeneity and complexity of cell populations. The current analysis methods are mainly to learn the similarity between cells and cells. Then they use the clustering algorithm to perform cell clustering or downstream analysis on the obtained similarity matrix. Therefore, constructing accurate cell-to-cell similarity is crucial for single-cell data analysis. In this paper, we design a novel Cauchy non-negative Laplacian regularized low-rank representation (CNLLRR) method to get a better similarity matrix. Specifically, Cauchy loss function (CLF) constraint is applied to punish noise matrix, which will improve the robustness of CNLLRR to noise and outliers. Moreover, graph regularization term is applied to the objective function, which will effectively encode the local manifold information of the data. Further, these will guarantee the quality of the cell-to-cell similarity matrix learned. Finally, single-cell data analysis experiments show that our method is superior to other representative methods.


2020 ◽  
Vol 10 ◽  
Author(s):  
Conghai Lu ◽  
Juan Wang ◽  
Jinxing Liu ◽  
Chunhou Zheng ◽  
Xiangzhen Kong ◽  
...  

Author(s):  
Yuheng Jia ◽  
Hui Liu ◽  
Junhui Hou ◽  
Sam Kwong ◽  
Qingfu Zhang

Sign in / Sign up

Export Citation Format

Share Document