13 results on '"Gao, Ying-Lian"'
Search Results
2. Single-Cell RNA Sequencing Data Clustering by Low-Rank Subspace Ensemble Framework.
- Author
-
Wang, Chuan-Yuan, Gao, Ying-Lian, Liu, Jin-Xing, Kong, Xiang-Zhen, and Zheng, Chun-Hou
- Abstract
The rapid development of single-cell RNA sequencing (scRNA-seq)technology reveals the gene expression status and gene structure of individual cells, reflecting the heterogeneity and diversity of cells. The traditional methods of scRNA-seq data analysis treat data as the same subspace, and hide structural information in other subspaces. In this paper, we propose a low-rank subspace ensemble clustering framework (LRSEC)to analyze scRNA-seq data. Assuming that the scRNA-seq data exist in multiple subspaces, the low-rank model is used to find the lowest rank representation of the data in the subspace. It is worth noting that the penalty factor of the low-rank kernel function is uncertain, and different penalty factors correspond to different low-rank structures. Moreover, the single cluster model is difficult to find the cellular structure of all datasets. To strengthen the correlation between model solutions, we construct a new ensemble clustering framework LRSEC by using the low-rank model as the basic learner. The LRSEC framework captures the global structure of data through low-rank subspaces, which has better clustering performance than a single clustering model. We validate the performance of the LRSEC framework on seven small datasets and one large dataset and obtain satisfactory results. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
3. Unsupervised Cluster Analysis and Gene Marker Extraction of scRNA-seq Data Based On Non-Negative Matrix Factorization.
- Author
-
Wang, Chuan-Yuan, Gao, Ying-Lian, Kong, Xiang-Zhen, Liu, Jin-Xing, and Zheng, Chun-Hou
- Subjects
NONNEGATIVE matrices ,MATRIX decomposition ,CLUSTER analysis (Statistics) ,DATA extraction ,GENE clusters ,MICROARRAY technology ,IMAGE fusion - Abstract
The development of single-cell RNA sequencing (scRNA-seq) technology has made it possible to measure gene expression levels at the resolution of a single cell, which further reveals the complex growth processes of cells such as mutation and differentiation. Recognizing cell heterogeneity is one of the most critical tasks in scRNA-seq research. To solve it, we propose a non-negative matrix factorization framework based on multi-subspace cell similarity learning for unsupervised scRNA-seq data analysis (MscNMF). MscNMF includes three parts: data decomposition, similarity learning, and similarity fusion. The three work together to complete the data similarity learning task. MscNMF can learn the gene features and cell features of different subspaces, and the correlation and heterogeneity between cells will be more prominent in multi-subspaces. The redundant information and noise in each low-dimensional feature space are eliminated, and its gene weight information can be further analyzed to calculate the optimal number of subpopulations. The final cell similarity learning will be more satisfactory due to the fusion of cell similarity information in different subspaces. The advantage of MscNMF is that it can calculate the number of cell types and the rank of Non-negative matrix factorization (NMF) reasonably. Experiments on eight real scRNA-seq datasets show that MscNMF can effectively perform clustering tasks and extract useful genetic markers. To verify its clustering performance, the framework is compared with other latest clustering algorithms and satisfactory results are obtained. The code of MscNMF is free available for academic (https://github.com/wangchuanyuan1/project-MscNMF). [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
4. Dual Hyper-Graph Regularized Supervised NMF for Selecting Differentially Expressed Genes and Tumor Classification.
- Author
-
Wang, Chuan-Yuan, Yu, Na, Wu, Ming-Juan, Gao, Ying-Lian, Liu, Jin-Xing, and Wang, Juan
- Abstract
Non-negative matrix factorization (NMF) is a dimensionality reduction technique based on high-dimensional mapping. It can learn part-based representations effectively. In this paper, we propose a method called Dual Hyper-graph Regularized Supervised Non-negative Matrix Factorization (HSNMF). To encode the geometric information of the data, the hyper-graph is introduced into the model as a regularization term. The advantage of hyper-graph learning is to find higher order data relationship to enhance data relevance. This method constructs the data hyper-graph and the feature hyper-graph to find the data manifold and the feature manifold simultaneously. The application of hyper-graph theory in cancer datasets can effectively find pathogenic genes. The discrimination information is further introduced into the objective function to obtain more information about the data. Supervised learning with label information greatly improves the classification effect. Furthermore, the real datasets of cancer usually contain sparse noise, so the $L_{2,1}$ L 2 , 1 -norm is applied to enhance the robustness of HSNMF algorithm. Experiments under The Cancer Genome Atlas (TCGA) datasets verify the feasibility of the HSNMF method. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
5. Hyper-Graph Regularized Constrained NMF for Selecting Differentially Expressed Genes and Tumor Classification.
- Author
-
Jiao, Cui-Na, Gao, Ying-Lian, Yu, Na, Liu, Jin-Xing, and Qi, Lian-Yong
- Subjects
TUMOR classification ,NONNEGATIVE matrices ,MATRIX decomposition ,ALGORITHMS ,CANCER genes ,GRAPH theory ,GENES ,HYPERGRAPHS - Abstract
Non-negative Matrix Factorization (NMF) is a dimensionality reduction approach for learning a parts-based and linear representation of non-negative data. It has attracted more attention because of that. In practice, NMF not only neglects the manifold structure of data samples, but also overlooks the priori label information of different classes. In this paper, a novel matrix decomposition method called Hyper-graph regularized Constrained Non-negative Matrix Factorization (HCNMF) is proposed for selecting differentially expressed genes and tumor sample classification. The advantage of hyper-graph learning is to capture local spatial information in high dimensional data. This method incorporates a hyper-graph regularization constraint to consider the higher order data sample relationships. The application of hyper-graph theory can effectively find pathogenic genes in cancer datasets. Besides, the label information is further incorporated in the objective function to improve the discriminative ability of the decomposition matrix. Supervised learning with label information greatly improves the classification effect. We also provide the iterative update rules and convergence proofs for the optimization problems of HCNMF. Experiments under The Cancer Genome Atlas (TCGA) datasets confirm the superiority of HCNMF algorithm compared with other representative algorithms through a set of evaluations. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
6. Integrative Hypergraph Regularization Principal Component Analysis for Sample Clustering and Co-Expression Genes Network Analysis on Multi-Omics Data.
- Author
-
Wu, Ming-Juan, Gao, Ying-Lian, Liu, Jin-Xing, Zheng, Chun-Hou, and Wang, Juan
- Subjects
PRINCIPAL components analysis ,GENE regulatory networks ,CLUSTER sampling ,MATHEMATICAL regularization ,DATA analysis ,TIKHONOV regularization - Abstract
In recent years, with the diversity and variability of cancer information, the multi-omics data have been applied in various fields. Many existing models of principal component analysis can only process single data, which makes limitations on cancer research. Therefore, in this paper, a new model called integrative principal component analysis (IPCA) is proposed to achieve the unification of multi-omics data. In addition, in order to preserve the high-order manifold structure between the data, an integrative hypergraph regularization principal component analysis (IHPCA) is further proposed by applying the hypergraph regularization constraint. The effectiveness of IHPCA method is tested on four multi-omics datasets. Experimental results show that the proposed method has better performance than other representative methods on sample clustering and common expression genes (co-expression genes) network analysis. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
7. Regularized Non-Negative Matrix Factorization for Identifying Differentially Expressed Genes and Clustering Samples: A Survey.
- Author
-
Liu, Jin-Xing, Wang, Dong, Gao, Ying-Lian, Zheng, Chun-Hou, Xu, Yong, and Yu, Jiguo
- Abstract
Non-negative Matrix Factorization (NMF), a classical method for dimensionality reduction, has been applied in many fields. It is based on the idea that negative numbers are physically meaningless in various data-processing tasks. Apart from its contribution to conventional data analysis, the recent overwhelming interest in NMF is due to its newly discovered ability to solve challenging data mining and machine learning problems, especially in relation to gene expression data. This survey paper mainly focuses on research examining the application of NMF to identify differentially expressed genes and to cluster samples, and the main NMF models, properties, principles, and algorithms with its various generalizations, extensions, and modifications are summarized. The experimental results demonstrate the performance of the various NMF algorithms in identifying differentially expressed genes and clustering samples. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
8. Robust Principal Component Analysis Regularized by Truncated Nuclear Norm for Identifying Differentially Expressed Genes.
- Author
-
Wang, Ya-Xuan, Gao, Ying-Lian, Liu, Jin-Xing, Kong, Xiang-Zhen, and Li, Hai-Jun
- Abstract
Identifying differentially expressed genes from the thousands of genes is a challenging task. Robust principal component analysis (RPCA) is an efficient method in the identification of differentially expressed genes. RPCA method uses nuclear norm to approximate the rank function. However, theoretical studies showed that the nuclear norm minimizes all singular values, so it may not be the best solution to approximate the rank function. The truncated nuclear norm is defined as the sum of some smaller singular values, which may achieve a better approximation of the rank function than nuclear norm. In this paper, a novel method is proposed by replacing nuclear norm of RPCA with the truncated nuclear norm, which is named robust principal component analysis regularized by truncated nuclear norm (TRPCA). The method decomposes the observation matrix of genomic data into a low-rank matrix and a sparse matrix. Because the significant genes can be considered as sparse signals, the differentially expressed genes are viewed as the sparse perturbation signals. Thus, the differentially expressed genes can be identified according to the sparse matrix. The experimental results on The Cancer Genome Atlas data illustrate that the TRPCA method outperforms other state-of-the-art methods in the identification of differentially expressed genes. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
9. Joint L1/2-Norm Constraint and Graph-Laplacian PCA Method for Feature Extraction.
- Author
-
Feng, Chun-Mei, Gao, Ying-Lian, Liu, Jin-Xing, Wang, Juan, Wang, Dong-Qin, and Wen, Chang-Gang
- Subjects
- *
BIOINFORMATICS , *GENE expression , *GENES , *GRAPHIC arts , *RESEARCH funding , *SEQUENCE analysis - Abstract
Principal Component Analysis (PCA) as a tool for dimensionality reduction is widely used in many areas. In the area of bioinformatics, each involved variable corresponds to a specific gene. In order to improve the robustness of PCA-based method, this paper proposes a novel graph-Laplacian PCA algorithm by adopting L1/2 constraint (L1/2 gLPCA) on error function for feature (gene) extraction. The error function based on L1/2-norm helps to reduce the influence of outliers and noise. Augmented Lagrange Multipliers (ALM) method is applied to solve the subproblem. This method gets better results in feature extraction than other state-of-the-art PCA-based methods. Extensive experimental results on simulation data and gene expression data sets demonstrate that our method can get higher identification accuracies than others. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
10. Block-Constraint Robust Principal Component Analysis and its Application to Integrated Analysis of TCGA Data.
- Author
-
Liu, Jin-Xing, Gao, Ying-Lian, Zheng, Chun-Hou, Xu, Yong, and Yu, Jiguo
- Abstract
The Cancer Genome Atlas (TCGA) dataset provides us more opportunities to systematically and comprehensively learn some biological mechanism of cancers formation, growth and metastasis. Since TCGA dataset includes heterogeneous data, it is one of the bioinformatics bottlenecks to mine some meaningful information from them. In this paper, to improve the performance of Robust Principal Component Analysis (RPCA) analyzing these heterogeneous data, a modified RPCA-based method, Block-Constraint Robust Principal Component Analysis (BCRPCA), is proposed. Since different categories data have different peculiarities, BCRPCA enforces different constraint intensities on different categories to improve the performance of RPCA. Firstly, the observation matrix of TCGA data is decomposed into two adding matrices A and S by using BCRPCA. Secondly, we use a ranking scheme to evaluate every feature and project these features to the genes. Then, the genes with high scores will be identified as differentially expressed ones. The main contributions of this paper are as following: firstly, it proposes, for the first time, the idea and method of BCRPCA to model TCGA data; secondly, it provides a BCRPCA-based framework for integrated analysis of TCGA data. The results show that our method is effective and suitable to analyze these data. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
11. A Class-Information-Based Sparse Component Analysis Method to Identify Differentially Expressed Genes on RNA-Seq Data.
- Author
-
Liu, Jin-Xing, Xu, Yong, Gao, Ying-Lian, Zheng, Chun-Hou, Wang, Dong, and Zhu, Qi
- Abstract
With the development of deep sequencing technologies, many RNA-Seq data have been generated. Researchers have proposed many methods based on the sparse theory to identify the differentially expressed genes from these data. In order to improve the performance of sparse principal component analysis, in this paper, we propose a novel class-information-based sparse component analysis (CISCA) method which introduces the class information via a total scatter matrix. First, CISCA normalizes the RNA-Seq data by using a Poisson model to obtain their differential sections. Second, the total scatter matrix is gotten by combining the between-class and within-class scatter matrices. Third, we decompose the total scatter matrix by using singular value decomposition and construct a new data matrix by using singular values and left singular vectors. Then, aiming at obtaining sparse components, CISCA decomposes the constructed data matrix by solving an optimization problem with sparse constraints on loading vectors. Finally, the differentially expressed genes are identified by using the sparse loading vectors. The results on simulation and real RNA-Seq data demonstrate that our method is effective and suitable for analyzing these data. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
12. Differential Expression Analysis on RNA-Seq Count Data Based on Penalized Matrix Decomposition.
- Author
-
Liu, Jin-Xing, Gao, Ying-Lian, Xu, Yong, Zheng, Chun-Hou, and You, Jane
- Abstract
With the development of deep sequencing, vast amounts of RNA-Seq data have been generated. It is crucial how to extract and interpret the meaningful information contained in deep sequencing data. In this paper, based on penalized matrix decomposition (PMD), a novel method, named PMDSeq, was proposed to analyze RNA-seq count data. Firstly, to obtain the differential expression matrix, the matrix of RNA-seq count data was normalized. Secondly, the differential expression matrix was decomposed into three factor matrices. By imposing appropriate constraint on factor matrices, the PMDSeq method can highlight the differentially expressed genes. Thirdly, the proposed method can identify the differentially expressed genes based on the scaled eigensamples. Finally, we used gene ontology tools to check these differentially expressed genes. The experimental results on simulation and three real RNA-seq count data sets demonstrated the effectiveness of our method. [ABSTRACT FROM PUBLISHER]
- Published
- 2014
- Full Text
- View/download PDF
13. Co-differential Gene Selection and Clustering Based on Graph Regularized Multi-View NMF in Cancer Genomic Data.
- Author
-
Yu, Na, Gao, Ying-Lian, Liu, Jin-Xing, Shang, Junliang, Zhu, Rong, and Dai, Ling-Yun
- Subjects
- *
CANCER genetics , *GENE clusters , *NONNEGATIVE matrices , *MEDICAL databases , *BIOINFORMATICS - Abstract
Cancer genomic data contain views from different sources that provide complementary information about genetic activity. This provides a new way for cancer research. Feature selection and multi-view clustering are hot topics in bioinformatics, and they can make full use of complementary information to improve the effect. In this paper, a novel integrated model called Multi-view Non-negative Matrix Factorization (MvNMF) is proposed for the selection of common differential genes (co-differential genes) and multi-view clustering. In order to encode the geometric information in the multi-view genomic data, graph regularized MvNMF (GMvNMF) is further proposed by applying the graph regularization constraint in the objective function. GMvNMF can not only obtain the potential shared feature structure and shared cluster group structure, but also capture the manifold structure of multi-view data. The validity of the proposed GMvNMF method was tested in four multi-view genomic data. Experimental results showed that the GMvNMF method has better performance than other representative methods. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.