48 results on '"Gao, Ying-Lian"'
Search Results
2. A Graph Representation Approach Based on Light Gradient Boosting Machine for Predicting Drug–Disease Associations.
- Author
-
Wang, Ying, Liu, Jin-xing, Wang, Juan, Shang, Junliang, and Gao, Ying-lian
- Published
- 2023
- Full Text
- View/download PDF
3. BMPMDA: Prediction of MiRNA-Disease Associations Using a Space Projection Model Based on Block Matrix.
- Author
-
Shen, Yi, Liu, Jin-Xing, Yin, Meng-Meng, Zheng, Chun-Hou, and Gao, Ying-Lian
- Subjects
DATA integrity ,BIOLOGICAL models ,INFORMATION networks ,PREDICTION models ,FORECASTING ,VIDEO coding - Abstract
With the high-quality development of bioinformatics technology, miRNA-disease associations (MDAs) are gradually being uncovered. At present, convenient and efficient prediction methods, which solve the problem of resource-consuming in traditional wet experiments, need to be further put forward. In this study, a space projection model based on block matrix is presented for predicting MDAs (BMPMDA). Specifically, two block matrices are first composed of the known association matrix and similarity to increase comprehensiveness. For the integrity of information in the heterogeneous network, matrix completion (MC) is utilized to mine potential MDAs. Considering the neighborhood information of data points, linear neighborhood similarity (LNS) is regarded as a measure of similarity. Next, LNS is projected onto the corresponding completed association matrix to derive the projection score. Finally, the AUC and AUPR values for BMPMDA reach 0.9691 and 0.6231, respectively. Additionally, the majority of novel MDAs in three disease cases are identified in existing databases and literature. It suggests that BMPMDA can serve as a reliable prediction model for biological research. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
4. new framework for drug–disease association prediction combing light-gated message passing neural network and gated fusion mechanism.
- Author
-
Liu, Bao-Min, Gao, Ying-Lian, Zhang, Dai-Jun, Zhou, Feng, Wang, Juan, Zheng, Chun-Hou, and Liu, Jin-Xing
- Subjects
MESSAGE passing (Computer science) ,DRUG repositioning ,ETIOLOGY of diseases ,CELL fusion ,FORECASTING - Abstract
With the development of research on the complex aetiology of many diseases, computational drug repositioning methodology has proven to be a shortcut to costly and inefficient traditional methods. Therefore, developing more promising computational methods is indispensable for finding new candidate diseases to treat with existing drugs. In this paper, a model integrating a new variant of message passing neural network and a novel-gated fusion mechanism called GLGMPNN is proposed for drug–disease association prediction. First, a light-gated message passing neural network (LGMPNN), including message passing, aggregation and updating, is proposed to separately extract multiple pieces of information from the similarity networks and the association network. Then, a gated fusion mechanism consisting of a forget gate and an output gate is applied to integrate the multiple pieces of information to extent. The forget gate calculated by the multiple embeddings is built to integrate the association information into the similarity information. Furthermore, the final node representations are controlled by the output gate, which fuses the topology information of the networks and the initial similarity information. Finally, a bilinear decoder is adopted to reconstruct an adjacency matrix for drug–disease associations. Evaluated by 10-fold cross-validations, GLGMPNN achieves excellent performance compared with the current models. The following studies show that our model can effectively discover novel drug–disease associations. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
5. Robust Principal Component Analysis Based On Hypergraph Regularization for Sample Clustering and Co-Characteristic Gene Selection.
- Author
-
Gao, Ying-Lian, Wu, Ming-Juan, Liu, Jin-Xing, Zheng, Chun-Hou, and Wang, Juan
- Abstract
Extracting genes involved in cancer lesions from gene expression data is critical for cancer research and drug development. The method of feature selection has attracted much attention in the field of bioinformatics. Principal Component Analysis (PCA) is a widely used method for learning low-dimensional representation. Some variants of PCA have been proposed to improve the robustness and sparsity of the algorithm. However, the existing methods ignore the high-order relationships between data. In this paper, a new model named Robust Principal Component Analysis via Hypergraph Regularization (HRPCA) is proposed. In detail, HRPCA utilizes L2,1-norm to reduce the effect of outliers and make data sufficiently row-sparse. And the hypergraph regularization is introduced to consider the complex relationship among data. Important information hidden in the data are mined, and this method ensures the accuracy of the resulting data relationship information. Extensive experiments on multi-view biological data demonstrate that the feasible and effective of the proposed approach. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
6. NCPLP: A Novel Approach for Predicting Microbe-Associated Diseases With Network Consistency Projection and Label Propagation.
- Author
-
Yin, Meng-Meng, Liu, Jin-Xing, Gao, Ying-Lian, Kong, Xiang-Zhen, and Zheng, Chun-Hou
- Abstract
A growing number of clinical studies have provided substantial evidence of a close relationship between the microbe and the disease. Thus, it is necessary to infer potential microbe–disease associations. But traditional approaches use experiments to validate these associations that often spend a lot of materials and time. Hence, more reliable computational methods are expected to be applied to predict disease-associated microbes. In this article, an innovative mean for predicting microbe–disease associations is proposed, which is based on network consistency projection and label propagation (NCPLP). Given that most existing algorithms use the Gaussian interaction profile (GIP) kernel similarity as the similarity criterion between microbe pairs and disease pairs, in this model, Medical Subject Headings descriptors are considered to calculate disease semantic similarity. In addition, 16S rRNA gene sequences are borrowed for the calculation of microbe functional similarity. In view of the gene-based sequence information, we use two conventional methods (BLAST+ and MEGA7) to assess the similarity between each pair of microbes from different perspectives. Especially, network consistency projection is added to obtain network projection scores from the microbe space and the disease space. Ultimately, label propagation is utilized to reliably predict microbes related to diseases. NCPLP achieves better performance in various evaluation indicators and discovers a greater number of potential associations between microbes and diseases. Also, case studies further confirm the reliable prediction performance of NCPLP. To conclude, our algorithm NCPLP has the ability to discover these underlying microbe–disease associations and can provide help for biological study. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
7. Tensor decomposition based on the potential low-rank and p-shrinkage generalized threshold algorithm for analyzing cancer multiomics data.
- Author
-
Yang, Hang-Jin, Lei, Yu-Xia, Wang, Juan, Kong, Xiang-Zhen, Liu, Jin-Xing, and Gao, Ying-Lian
- Subjects
SINGULAR value decomposition ,PRINCIPAL components analysis ,FEATURE selection ,DECOMPOSITION method ,CANCER genes ,ALGORITHMS - Abstract
Tensor Robust Principal Component Analysis (TRPCA) has achieved promising results in the analysis of genomics data. However, the TRPCA model under the existing tensor singular value decomposition (t -SVD) framework insufficiently extracts the potential low-rank structure of the data, resulting in suboptimal restored components. Simultaneously, the tensor nuclear norm (TNN) defined based on t -SVD uses the same standard to handle various singular values. TNN ignores the difference of singular values, leading to the failure of the main information that needs to be well preserved. To preserve the heterogeneous structure in the low-rank information, we propose a novel TNN and extend it to the TRPCA model. Potential low-rank space may contain important information. We learn the low-rank structural information from the core tensor. The singular value space contains the association information between genes and cancers. The p -shrinkage generalized threshold function is utilized to preserve the low-rank properties of larger singular values. The optimization problem is solved by the alternating direction method of the multiplier (ADMM) algorithm. Clustering and feature selection experiments are performed on the TCGA data set. The experimental results show that the proposed model is more promising than other state-of-the-art tensor decomposition methods. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
8. 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
9. 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
10. Kernel risk-sensitive mean p-power error based robust extreme learning machine for classification.
- Author
-
Ren, Liang-Rui, Gao, Ying-Lian, Shang, Junliang, and Liu, Jin-Xing
- Abstract
Recently, extreme learning machine (ELM) has attracted a lot of attention due to its high performance and extreme speed. However, how to improve the robustness of ELM has always been a problem. Considering the problems of noise and outliers in the experimental data, in this paper, we introduce the kernel risk-sensitive mean p-power error (KRP) into ELM and propose a robust ELM method named kernel risk-sensitive mean p-power error based robust extreme learning machine (KRPELM), on the basis of the high efficiency and robustness of KRP. In KRPELM, KRP function instead of square loss is integrated into ELM as the loss function, which can improve the robustness of ELM to noise and outliers. We also propose an efficient iterative adjustment strategy to optimize KRPELM. Nine benchmark datasets are utilized to verify the classification performance of the proposed KRPELM. In addition, we apply the proposed method to the classification of cancer samples. The experimental results on five cancer gene expression datasets show that KRPELM can identify different cancer types more accurately. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
11. 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
12. Adaptive Total-Variation Regularized Low-Rank Representation for Analyzing Single-Cell RNA-seq Data.
- Author
-
Liu, Jin-Xing, Wang, Chuan-Yuan, Gao, Ying-Lian, Zhang, Yulin, Wang, Juan, and Li, Sheng-Jun
- Subjects
NUCLEOTIDE sequencing ,RNA sequencing ,CELL populations ,CELL physiology ,GENE expression ,LOW-rank matrices - Abstract
High-throughput sequencing of single-cell gene expression reveals a complex mechanism of individual cell's heterogeneity in a population. An important purpose for analyzing single-cell RNA sequencing (scRNA-seq) data is to identify cell subtypes and functions by cell clustering. To deal with high levels of noise and cellular heterogeneity, we introduced a new single cell data analysis model called Adaptive Total-Variation Regularized Low-Rank Representation (ATV-LRR). In scRNA-seq data, ATV-LRR can reconstruct the low-rank subspace structure to learn the similarity of cells. The low-rank representation can not only segment multiple linear subspaces, but also extract important information. Moreover, adaptive total variation also can remove cell noise and preserve cell feature details by learning the gradient information of the data. At the same time, to analyze scRNA-seq data with unknown prior information, we introduced the maximum eigenvalue method into the ATV-LRR model to automatically identify cell populations. The final clustering results show that the ATV-LRR model can detect cell types more effectively and stably. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
13. DSTPCA: Double-Sparse Constrained Tensor Principal Component Analysis Method for Feature Selection.
- Author
-
Hu, Yue, Liu, Jin-Xing, Gao, Ying-Lian, and Shang, Junliang
- Abstract
The identification of differentially expressed genes plays an increasingly important role biologically. Therefore, the feature selection approach has attracted much attention in the field of bioinformatics. The most popular method of principal component analysis studies two-dimensional data without considering the spatial geometric structure of the data. The recently proposed tensor robust principal component analysis method performs sparse and low-rank decomposition on three-dimensional tensors and effectively preserves the spatial structure. Based on this approach, the L
2,1 -norm regularization term is introduced into the DSTPCA (Double-Sparse Constrained Tensor Principal Component Analysis) method. The DSTPCA method removes the redundant noise by double sparse constraints on the objective function to obtain sufficiently sparse results. After the regularization norm is introduced into the model, the ADMM (alternating direction method of multipliers) algorithm is used to solve the optimal problem. In the experiment of feature selection, while the more redundant genes were filtered out, the more genes closely associated with disease were screened. Experimental results using different datasets indicate that our method outperforms other methods. [ABSTRACT FROM AUTHOR]- Published
- 2021
- Full Text
- View/download PDF
14. Multi-Label Fusion Collaborative Matrix Factorization for Predicting LncRNA-Disease Associations.
- Author
-
Gao, Ming-Ming, Cui, Zhen, Gao, Ying-Lian, Wang, Juan, and Liu, Jin-Xing
- Subjects
MATRIX decomposition ,COLORECTAL cancer ,LUNG cancer ,OVARIAN cancer ,FORECASTING ,LABELS - Abstract
As we all know, science and technology are developing faster and faster. Many experts and scholars have demonstrated that human diseases are related to lncRNA, but only a few associations have been confirmed, and many unknown associations need to be found. In the process of finding associations, it takes a lot of time, so finding an efficient way to predict the associations between lncRNAs and diseases is particularly important. In this paper, we propose a multi-label fusion collaborative matrix factorization (MLFCMF) approach for predicting lncRNA-disease associations (LDAs). Firstly, the lncRNA space and disease space are optimized by multi-label to enhance the intrinsic link between lncRNA and disease and to tap potential information. Multi-label learning can encode a variety of data information from the sample space. Secondly, to learn multi-label information in the data space, the fusion method is used to handle the relationship between multiple labels. More comprehensive information will be obtained by weighing the effects of different labels. The addition of Gaussian interaction profile (GIP) kernel can increase the network similarity. Finally, the lncRNA-disease associations are predicted by the method of collaborative matrix factorization. The ten-fold cross-validation method is used to evaluate the MLFCMF method, and our method finally obtains an AUC value of 0.8612. Detailed analysis of ovarian cancer, colorectal cancer, and lung cancer in the simulation experiment results. So it can be seen that our method MLFCMF is an effective model for predicting lncRNA-disease associations. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
15. Sparse robust graph-regularized non-negative matrix factorization based on correntropy.
- Author
-
Wang, Chuan-Yuan, Gao, Ying-Lian, Liu, Jin-Xing, Dai, Ling-Yun, and Shang, Junliang
- Subjects
NONNEGATIVE matrices ,MATRIX decomposition ,FACTORIZATION ,MATHEMATICAL regularization ,FEATURE selection ,EUCLIDEAN distance ,KERNEL functions - Abstract
Non-negative Matrix Factorization (NMF) is a popular data dimension reduction method in recent years. The traditional NMF method has high sensitivity to data noise. In the paper, we propose a model called Sparse Robust Graph-regularized Non-negative Matrix Factorization based on Correntropy (SGNMFC). The maximized correntropy replaces the traditional minimized Euclidean distance to improve the robustness of the algorithm. Through the kernel function, correntropy can give less weight to outliers and noise in data but give greater weight to meaningful data. Meanwhile, the geometry structure of the high-dimensional data is completely preserved in the low-dimensional manifold through the graph regularization. Feature selection and sample clustering are commonly used methods for analyzing genes. Sparse constraints are applied to the loss function to reduce matrix complexity and analysis difficulty. Comparing the other five similar methods, the effectiveness of the SGNMFC model is proved by selection of differentially expressed genes and sample clustering experiments in three The Cancer Genome Atlas (TCGA) datasets. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
16. WGRCMF: A Weighted Graph Regularized Collaborative Matrix Factorization Method for Predicting Novel LncRNA-Disease Associations.
- Author
-
Liu, Jin-Xing, Cui, Zhen, Gao, Ying-Lian, and Kong, Xiang-Zhen
- Subjects
MATRIX decomposition ,WEIGHTED graphs ,FACTORIZATION ,FORECASTING - Abstract
In recent years, many human diseases have been determined to be associated with certain lncRNAs. Only a small percentage of all lncRNA-disease associations (LDAs) have been discovered by researchers. Predicting novel LDAs is time-consuming and costly. It is crucial to propose a method that can effectively identify potential LDAs to solve this problem based on the available datasets. Although some current methods can effectively predict potential LDAs, the prediction accuracy needs to be improved, and there are few known associations. Moreover, there are notable errors in the method of constructing the network and the bipartite graph, which interfere with the final results. A weighted graph regularized collaborative matrix factorization (WGRCMF) method is proposed to predict novel LDAs. We introduce the graph regularization terms into the collaborative matrix factorization. Considering that manifold learning can recover low-dimensional manifold structures from high-dimensional sampled data, we can find low-dimensional manifolds in high-dimensional space. In addition, a weight matrix is also introduced into the method, the significance of which is to prevent unknown associations from contributing to the final prediction matrix. Finally, the prediction accuracy of this method is better than those of other methods. In several cancer cases, we implemented the corresponding simulation experiments. According to the experimental results, the proposed method is feasible and effective. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
17. MCCMF: collaborative matrix factorization based on matrix completion for predicting miRNA-disease associations.
- Author
-
Wu, Tian-Ru, Yin, Meng-Meng, Jiao, Cui-Na, Gao, Ying-Lian, Kong, Xiang-Zhen, and Liu, Jin-Xing
- Subjects
MATRIX decomposition ,NON-coding RNA ,MICRORNA ,FORECASTING - Abstract
Background: MicroRNAs (miRNAs) are non-coding RNAs with regulatory functions. Many studies have shown that miRNAs are closely associated with human diseases. Among the methods to explore the relationship between the miRNA and the disease, traditional methods are time-consuming and the accuracy needs to be improved. In view of the shortcoming of previous models, a method, collaborative matrix factorization based on matrix completion (MCCMF) is proposed to predict the unknown miRNA-disease associations. Results: The complete matrix of the miRNA and the disease is obtained by matrix completion. Moreover, Gaussian Interaction Profile kernel is added to the miRNA functional similarity matrix and the disease semantic similarity matrix. Then the Weight K Nearest Known Neighbors method is used to pretreat the association matrix, so the model is close to the reality. Finally, collaborative matrix factorization method is applied to obtain the prediction results. Therefore, the MCCMF obtains a satisfactory result in the fivefold cross-validation, with an AUC of 0.9569 (0.0005). Conclusions: The AUC value of MCCMF is higher than other advanced methods in the fivefold cross validation experiment. In order to comprehensively evaluate the performance of MCCMF, accuracy, precision, recall and f-measure are also added. The final experimental results demonstrate that MCCMF outperforms other methods in predicting miRNA-disease associations. In the end, the effectiveness and practicability of MCCMF are further verified by researching three specific diseases. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
18. 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
19. 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
20. LncRNA-Disease Associations Prediction Using Bipartite Local Model With Nearest Profile-Based Association Inferring.
- Author
-
Cui, Zhen, Liu, Jin-Xing, Gao, Ying-Lian, Zhu, Rong, and Yuan, Sha-Sha
- Subjects
FORECASTING ,NON-coding RNA ,PREDICTION models ,NEAREST neighbor analysis (Statistics) - Abstract
There is much evidence that long non-coding RNA (lncRNA) is associated with many diseases. However, it is time-consuming and expensive to identify meaningful lncRNA-disease associations (LDAs) through medical or biological experiments. Therefore, investigating how to identify more meaningful LDAs is necessary, and at the same time it is conducive to the prevention, diagnosis and treatment of complex diseases. Considering the limitations of some current prediction models, a novel model based on bipartite local model with nearest profile-based association inferring, BLM-NPAI, is developed for predicting LDAs. This model predicts novel LDAs from the lncRNA side and the disease side, respectively. More importantly, for some lncRNAs and diseases without any association, the model can also be predicted by their nearest neighbors. Leave-one-out cross validation (LOOCV) and 5-fold cross validation are implemented for BLM-NPAI to evaluate the performance of this model. Our model is superior to current advanced methods in most cases. In addition, to verify the validity and reliability of BLM-NPAI, three disease cases and three lncRNA cases are analyzed to further evaluate BLM-NPAI. Finally, these predicted novel LDAs are confirmed by using the LncRNA-disease database. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
21. RCMF: a robust collaborative matrix factorization method to predict miRNA-disease associations.
- Author
-
Cui, Zhen, Liu, Jin-Xing, Gao, Ying-Lian, Zheng, Chun-Hou, and Wang, Juan
- Subjects
MATRIX decomposition - Abstract
Background: Predicting miRNA-disease associations (MDAs) is time-consuming and expensive. It is imminent to improve the accuracy of prediction results. So it is crucial to develop a novel computing technology to predict new MDAs. Although some existing methods can effectively predict novel MDAs, there are still some shortcomings. Especially when the disease matrix is processed, its sparsity is an important factor affecting the final results. Results: A robust collaborative matrix factorization (RCMF) is proposed to predict novel MDAs. The L
2,1 -norm are introduced to our method to achieve the highest AUC value than other advanced methods. Conclusions: 5-fold cross validation is used to evaluate our method, and simulation experiments are used to predict novel associations on Gold Standard Dataset. Finally, our prediction accuracy is better than other existing advanced methods. Therefore, our approach is effective and feasible in predicting novel MDAs. [ABSTRACT FROM AUTHOR]- Published
- 2019
- Full Text
- View/download PDF
22. Supervised Discriminative Sparse PCA for Com-Characteristic Gene Selection and Tumor Classification on Multiview Biological Data.
- Author
-
Feng, Chun-Mei, Xu, Yong, Liu, Jin-Xing, Gao, Ying-Lian, and Zheng, Chun-Hou
- Subjects
BIOLOGICAL classification ,TUMOR classification ,PRINCIPAL components analysis ,GENES ,AMBIGUITY - Abstract
Principal component analysis (PCA) has been used to study the pathogenesis of diseases. To enhance the interpretability of classical PCA, various improved PCA methods have been proposed to date. Among these, a typical method is the so-called sparse PCA, which focuses on seeking sparse loadings. However, the performance of these methods is still far from satisfactory due to their limitation of using unsupervised learning methods; moreover, the class ambiguity within the sample is high. To overcome this problem, this paper developed a new PCA method, which is named the supervised discriminative sparse PCA (SDSPCA). The main innovation of this method is the incorporation of discriminative information and sparsity into the PCA model. Specifically, in contrast to the traditional sparse PCA, which imposes sparsity on the loadings, here, sparse components are obtained to represent the data. Furthermore, via the linear transformation, the sparse components approximate the given label information. On the one hand, sparse components improve interpretability over the traditional PCA, while on the other hand, they are have discriminative abilities suitable for classification purposes. A simple algorithm is developed, and its convergence proof is provided. SDSPCA has been applied to the common-characteristic gene selection and tumor classification on multiview biological data. The sparsity and classification performance of SDSPCA are empirically verified via abundant, reasonable, and effective experiments, and the obtained results demonstrate that SDSPCA outperforms other state-of-the-art methods. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
23. Hypergraph Regularized Discriminative Nonnegative Matrix Factorization on Sample Classification and Co-Differentially Expressed Gene Selection.
- Author
-
Hao, Yong-Jing, Gao, Ying-Lian, Hou, Mi-Xiao, Dai, Ling-Yun, and Liu, Jin-Xing
- Subjects
NONNEGATIVE matrices ,MATRIX decomposition ,GEOMETRY ,BIG data ,DATA analysis - Abstract
Nonnegative Matrix Factorization (NMF) is a significant big data analysis technique. However, standard NMF regularized by simple graph does not have discriminative function, and traditional graph models cannot accurately reflect the problem of multigeometry information between data. To solve the above problem, this paper proposed a new method called Hypergraph Regularized Discriminative Nonnegative Matrix Factorization (HDNMF), which captures intrinsic geometry by constructing hypergraphs rather than simple graphs. The introduction of the hypergraph method allows high-order relationships between samples to be considered, and the introduction of label information enables the method to have discriminative effect. Both the hypergraph Laplace and the discriminative label information are utilized together to learn the projection matrix in the standard method. In addition, we offered a corresponding multiplication update solution for the optimization. Experiments indicate that the method proposed is more effective by comparing with the earlier methods. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
24. NPCMF: Nearest Profile-based Collaborative Matrix Factorization method for predicting miRNA-disease associations.
- Author
-
Gao, Ying-Lian, Cui, Zhen, Liu, Jin-Xing, Wang, Juan, and Zheng, Chun-Hou
- Subjects
MATRIX decomposition ,COLON cancer ,RECTAL cancer ,MICRORNA ,PREDICTION models - Abstract
Background: Predicting meaningful miRNA-disease associations (MDAs) is costly. Therefore, an increasing number of researchers are beginning to focus on methods to predict potential MDAs. Thus, prediction methods with improved accuracy are under development. An efficient computational method is proposed to be crucial for predicting novel MDAs. For improved experimental productivity, large biological datasets are used by researchers. Although there are many effective and feasible methods to predict potential MDAs, the possibility remains that these methods are flawed. Results: A simple and effective method, known as Nearest Profile-based Collaborative Matrix Factorization (NPCMF), is proposed to identify novel MDAs. The nearest profile is introduced to our method to achieve the highest AUC value compared with other advanced methods. For some miRNAs and diseases without any association, we use the nearest neighbour information to complete the prediction. Conclusions: To evaluate the performance of our method, five-fold cross-validation is used to calculate the AUC value. At the same time, three disease cases, gastric neoplasms, rectal neoplasms and colonic neoplasms, are used to predict novel MDAs on a gold-standard dataset. We predict the vast majority of known MDAs and some novel MDAs. Finally, the prediction accuracy of our method is determined to be better than that of other existing methods. Thus, the proposed prediction model can obtain reliable experimental results. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
25. L2,1-GRMF: an improved graph regularized matrix factorization method to predict drug-target interactions.
- Author
-
Cui, Zhen, Gao, Ying-Lian, Liu, Jin-Xing, Dai, Ling-Yun, and Yuan, Sha-Sha
- Subjects
MATRIX decomposition ,BIPARTITE graphs ,TARGETED drug delivery ,ISOINDOLE ,ALGORITHMS ,MATHEMATICAL regularization - Abstract
Background: Predicting drug-target interactions is time-consuming and expensive. It is important to present the accuracy of the calculation method. There are many algorithms to predict global interactions, some of which use drug-target networks for prediction (ie, a bipartite graph of bound drug pairs and targets known to interact). Although these algorithms can predict some drug-target interactions to some extent, there is little effect for some new drugs or targets that have no known interaction. Results: Since the datasets are usually located at or near low-dimensional nonlinear manifolds, we propose an improved GRMF (graph regularized matrix factorization) method to learn these flow patterns in combination with the previous matrix-decomposition method. In addition, we use one of the pre-processing steps previously proposed to improve the accuracy of the prediction. Conclusions: Cross-validation is used to evaluate our method, and simulation experiments are used to predict new interactions. In most cases, our method is superior to other methods. Finally, some examples of new drugs and new targets are predicted by performing simulation experiments. And the improved GRMF method can better predict the remaining drug-target interactions. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
26. Differentially Expressed Genes Extracted by the Tensor Robust Principal Component Analysis (TRPCA) Method.
- Author
-
Hu, Yue, Liu, Jin-Xing, Gao, Ying-Lian, Li, Sheng-Jun, and Wang, Juan
- Subjects
PRINCIPAL components analysis ,CANCER genes ,GENE expression ,GENE ontology ,BIG data - Abstract
In the big data era, sequencing technology has produced a large number of biological sequencing data. Different views of the cancer genome data provide sufficient complementary information to explore genetic activity. The identification of differentially expressed genes from multiview cancer gene data is of great importance in cancer diagnosis and treatment. In this paper, we propose a novel method for identifying differentially expressed genes based on tensor robust principal component analysis (TRPCA), which extends the matrix method to the processing of multiway data. To identify differentially expressed genes, the plan is carried out as follows. First, multiview data containing cancer gene expression data from different sources are prepared. Second, the original tensor is decomposed into a sum of a low-rank tensor and a sparse tensor using TRPCA. Third, the differentially expressed genes are considered to be sparse perturbed signals and then identified based on the sparse tensor. Fourth, the differentially expressed genes are evaluated using Gene Ontology and Gene Cards tools. The validity of the TRPCA method was tested using two sets of multiview data. The experimental results showed that our method is superior to the representative methods in efficiency and accuracy aspects. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
27. The computational prediction of drug-disease interactions using the dual-network L2,1-CMF method.
- Author
-
Cui, Zhen, Gao, Ying-Lian, Liu, Jin-Xing, Wang, Juan, Shang, Junliang, and Dai, Ling-Yun
- Subjects
DRUG interactions ,DRUG side effects ,RECOMMENDER systems ,KERNEL (Mathematics) ,GAUSSIAN processes ,MACHINE learning - Abstract
Background: Predicting drug-disease interactions (DDIs) is time-consuming and expensive. Improving the accuracy of prediction results is necessary, and it is crucial to develop a novel computing technology to predict new DDIs. The existing methods mostly use the construction of heterogeneous networks to predict new DDIs. However, the number of known interacting drug-disease pairs is small, so there will be many errors in this heterogeneous network that will interfere with the final results. Results: A novel method, known as the dual-network L
2,1 -collaborative matrix factorization, is proposed to predict novel DDIs. The Gaussian interaction profile kernels and L2,1 -norm are introduced in our method to achieve better results than other advanced methods. The network similarities of drugs and diseases with their chemical and semantic similarities are combined in this method. Conclusions: Cross validation is used to evaluate our method, and simulation experiments are used to predict new interactions using two different datasets. Finally, our prediction accuracy is better than other existing methods. This proves that our method is feasible and effective. [ABSTRACT FROM AUTHOR]- Published
- 2019
- Full Text
- View/download PDF
28. Principal Component Analysis Based on Graph Laplacian and Double Sparse Constraints for Feature Selection and Sample Clustering on Multi-View Data.
- Author
-
Wu, Ming-Juan, Gao, Ying-Lian, Liu, Jin-Xing, Zhu, Rong, and Wang, Juan
- Subjects
PRINCIPAL components analysis ,FEATURE selection ,CLUSTER sampling ,SPARSE matrices - Abstract
Principal component analysis (PCA) is a widely used method for evaluating low-dimensional data. Some variants of PCA have been proposed to improve the interpretation of the principal components (PCs). One of the most common methods is sparse PCA which aims at finding a sparse basis to improve the interpretability over the dense basis of PCA. However, the performances of these improved methods are still far from satisfactory because the data still contain redundant PCs. In this paper, a novel method called PCA based on graph Laplacian and double sparse constraints (GDSPCA) is proposed to improve the interpretation of the PCs and consider the internal geometry of the data. In detail, GDSPCA utilizes L
2,1 -norm and L1 -norm regularization terms simultaneously to enforce the matrix to be sparse by filtering redundant and irrelative PCs, where the L2,1 -norm regularization term can produce row sparsity, while the L1 -norm regularization term can enforce element sparsity. This way, we can make a better interpretation of the new PCs in low-dimensional subspace. Meanwhile, the method of GDSPCA integrates graph Laplacian into PCA to explore the geometric structure hidden in the data. A simple and effective optimization solution is provided. Extensive experiments on multi-view biological data demonstrate the feasibility and effectiveness of the proposed approach. [ABSTRACT FROM AUTHOR]- Published
- 2019
- Full Text
- View/download PDF
29. 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
30. A Simple Review of Sparse Principal Components Analysis.
- Author
-
Feng, Chun-Mei, Gao, Ying-Lian, Liu, Jin-Xing, Zheng, Chun-Hou, Li, Sheng-Jun, and Wang, Dong
- Published
- 2016
- Full Text
- View/download PDF
31. Comparison of Non-negative Matrix Factorization Methods for Clustering Genomic Data.
- Author
-
Hou, Mi-Xiao, Gao, Ying-Lian, Liu, Jin-Xing, Shang, Jun-Liang, and Zheng, Chun-Hou
- Published
- 2016
- Full Text
- View/download PDF
32. 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
33. PCA Based on Graph Laplacian Regularization and P-Norm for Gene Selection and Clustering.
- Author
-
Feng, Chun-Mei, Gao, Ying-Lian, Liu, Jin-Xing, Zheng, Chun-Hou, and Yu, Jiguo
- Abstract
In modern molecular biology, the hotspots and difficulties of this field are identifying characteristic genes from gene expression data. Traditional reconstruction-error-minimization model principal component analysis (PCA) as a matrix decomposition method uses quadratic error function, which is known sensitive to outliers and noise. Hence, it is necessary to learn a good PCA method when outliers and noise exist. In this paper, we develop a novel PCA method enforcing P-norm on error function and graph-Laplacian regularization term for matrix decomposition problem, which is called as PgLPCA. The heart of the method designing for reducing outliers and noise is a new error function based on non-convex proximal P-norm. Besides, Laplacian regularization term is used to find the internal geometric structure in the data representation. To solve the minimization problem, we develop an efficient optimization algorithm based on the augmented Lagrange multiplier method. This method is used to select characteristic genes and cluster the samples from explosive biological data, which has higher accuracy than compared methods. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
34. 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 L
1 /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
35. Graph Regularized Non-negative Matrix with L0-Constraints for Selecting Characteristic Genes.
- Author
-
Ma, Chun-Xia, Gao, Ying-Lian, Wang, Dong, Liu, Jian, and Liu, Jin-Xing
- Published
- 2015
- Full Text
- View/download PDF
36. Application of Graph Regularized Non-negative Matrix Factorization in Characteristic Gene Selection.
- Author
-
Wang, Dong, Gao, Ying-Lian, Liu, Jin-Xing, Yu, Ji-Guo, and Wen, Chang-Gang
- Published
- 2015
- Full Text
- View/download PDF
37. A Two-Stage Sparse Selection Method for Extracting Characteristic Genes.
- Author
-
Gao, Ying-Lian, Liu, Jin-Xing, Zheng, Chun-Hou, Li, Sheng-Jun, and Lei, Yu-Xia
- Published
- 2015
- Full Text
- View/download PDF
38. Semi-supervised Feature Extraction for RNA-Seq Data Analysis.
- Author
-
Liu, Jin-Xing, Xu, Yong, Gao, Ying-Lian, Wang, Dong, Zheng, Chun-Hou, and Shang, Jun-Liang
- Published
- 2015
- Full Text
- View/download PDF
39. 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
40. An NMF-L2,1-Norm Constraint Method for Characteristic Gene Selection.
- Author
-
Wang, Dong, Liu, Jin-Xing, Gao, Ying-Lian, Yu, Jiguo, Zheng, Chun-Hou, and Xu, Yong
- Subjects
GENE expression ,FACTORIZATION ,DATA analysis ,MATHEMATICAL regularization ,CANCER genes - Abstract
Recent research has demonstrated that characteristic gene selection based on gene expression data remains faced with considerable challenges. This is primarily because gene expression data are typically high dimensional, negative, non-sparse and noisy. However, existing methods for data analysis are able to cope with only some of these challenges. In this paper, we address all of these challenges with a unified method: nonnegative matrix factorization via the L
2,1 -norm (NMF-L2,1 ). While L2,1 -norm minimization is applied to both the error function and the regularization term, our method is robust to outliers and noise in the data and generates sparse results. The application of our method to plant and tumor gene expression data demonstrates that NMF-L2,1 can extract more characteristic genes than other existing state-of-the-art methods. [ABSTRACT FROM AUTHOR]- Published
- 2016
- Full Text
- View/download PDF
41. 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
42. A Class-information-based SNMF method for selecting characteristic genes.
- Author
-
Liu, Jin-Xing, Ma, Chun-Xia, Gao, Ying-Lian, Liu, Jian, and Zheng, Chun-Hou
- Published
- 2014
- Full Text
- View/download PDF
43. A P-Norm Robust Feature Extraction Method for Identifying Differentially Expressed Genes.
- Author
-
Liu, Jian, Liu, Jin-Xing, Gao, Ying-Lian, Kong, Xiang-Zhen, Wang, Xue-Song, and Wang, Dong
- Subjects
GENE expression ,MOLECULAR biology ,EXTRACTION techniques ,ROBUST statistics ,STATISTICAL correlation ,LOW-rank matrices - Abstract
In current molecular biology, it becomes more and more important to identify differentially expressed genes closely correlated with a key biological process from gene expression data. In this paper, based on the Schatten p-norm and L
p -norm, a novel p-norm robust feature extraction method is proposed to identify the differentially expressed genes. In our method, the Schatten p-norm is used as the regularization function to obtain a low-rank matrix and the Lp -norm is taken as the error function to improve the robustness to outliers in the gene expression data. The results on simulation data show that our method can obtain higher identification accuracies than the competitive methods. Numerous experiments on real gene expression data sets demonstrate that our method can identify more differentially expressed genes than the others. Moreover, we confirmed that the identified genes are closely correlated with the corresponding gene expression data. [ABSTRACT FROM AUTHOR]- Published
- 2015
- Full Text
- View/download PDF
44. A Class-Information-Based Penalized Matrix Decomposition for Identifying Plants Core Genes Responding to Abiotic Stresses.
- Author
-
Liu, Jin-Xing, Liu, Jian, Gao, Ying-Lian, Mi, Jian-Xun, Ma, Chun-Xia, and Wang, Dong
- Subjects
GENE expression in plants ,ABIOTIC stress ,MATRIX decomposition ,SUPPORT vector machines ,COMPUTATIONAL biology - Abstract
In terms of making genes expression data more interpretable and comprehensible, there exists a significant superiority on sparse methods. Many sparse methods, such as penalized matrix decomposition (PMD) and sparse principal component analysis (SPCA), have been applied to extract plants core genes. Supervised algorithms, especially the support vector machine-recursive feature elimination (SVM-RFE) method, always have good performance in gene selection. In this paper, we draw into class information via the total scatter matrix and put forward a class-information-based penalized matrix decomposition (CIPMD) method to improve the gene identification performance of PMD-based method. Firstly, the total scatter matrix is obtained based on different samples of the gene expression data. Secondly, a new data matrix is constructed by decomposing the total scatter matrix. Thirdly, the new data matrix is decomposed by PMD to obtain the sparse eigensamples. Finally, the core genes are identified according to the nonzero entries in eigensamples. The results on simulation data show that CIPMD method can reach higher identification accuracies than the conventional gene identification methods. Moreover, the results on real gene expression data demonstrate that CIPMD method can identify more core genes closely related to the abiotic stresses than the other methods. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
45. 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
46. Correntropy induced loss based sparse robust graph regularized extreme learning machine for cancer classification.
- Author
-
Ren, Liang-Rui, Gao, Ying-Lian, Liu, Jin-Xing, Shang, Junliang, and Zheng, Chun-Hou
- Subjects
TUMOR classification ,MACHINE learning ,FEEDFORWARD neural networks ,SPARSE graphs ,ARTIFICIAL neural networks - Abstract
Background: As a machine learning method with high performance and excellent generalization ability, extreme learning machine (ELM) is gaining popularity in various studies. Various ELM-based methods for different fields have been proposed. However, the robustness to noise and outliers is always the main problem affecting the performance of ELM. Results: In this paper, an integrated method named correntropy induced loss based sparse robust graph regularized extreme learning machine (CSRGELM) is proposed. The introduction of correntropy induced loss improves the robustness of ELM and weakens the negative effects of noise and outliers. By using the L
2,1 -norm to constrain the output weight matrix, we tend to obtain a sparse output weight matrix to construct a simpler single hidden layer feedforward neural network model. By introducing the graph regularization to preserve the local structural information of the data, the classification performance of the new method is further improved. Besides, we design an iterative optimization method based on the idea of half quadratic optimization to solve the non-convex problem of CSRGELM. Conclusions: The classification results on the benchmark dataset show that CSRGELM can obtain better classification results compared with other methods. More importantly, we also apply the new method to the classification problems of cancer samples and get a good classification effect. [ABSTRACT FROM AUTHOR]- Published
- 2020
- Full Text
- View/download PDF
47. Robust hypergraph regularized non-negative matrix factorization for sample clustering and feature selection in multi-view gene expression data.
- Author
-
Yu, Na, Gao, Ying-Lian, Liu, Jin-Xing, Wang, Juan, and Shang, Junliang
- Abstract
Background: As one of the most popular data representation methods, non-negative matrix decomposition (NMF) has been widely concerned in the tasks of clustering and feature selection. However, most of the previously proposed NMF-based methods do not adequately explore the hidden geometrical structure in the data. At the same time, noise and outliers are inevitably present in the data. Results: To alleviate these problems, we present a novel NMF framework named robust hypergraph regularized non-negative matrix factorization (RHNMF). In particular, the hypergraph Laplacian regularization is imposed to capture the geometric information of original data. Unlike graph Laplacian regularization which captures the relationship between pairwise sample points, it captures the high-order relationship among more sample points. Moreover, the robustness of the RHNMF is enhanced by using the L
2,1 -norm constraint when estimating the residual. This is because the L2,1 -norm is insensitive to noise and outliers. Conclusions: Clustering and common abnormal expression gene (com-abnormal expression gene) selection are conducted to test the validity of the RHNMF model. Extensive experimental results on multi-view datasets reveal that our proposed model outperforms other state-of-the-art methods. [ABSTRACT FROM AUTHOR]- Published
- 2019
- Full Text
- View/download PDF
48. 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.