RESUMO
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 L2,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.
Assuntos
Algoritmos , Análise de Componente Principal , Análise por Conglomerados , Regulação Neoplásica da Expressão Gênica , Humanos , Neoplasias/genéticaRESUMO
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.
Assuntos
Biologia Computacional , Neoplasias , Algoritmos , Análise por Conglomerados , Biologia Computacional/métodos , Humanos , Neoplasias/genética , Neoplasias/metabolismo , Análise de Componente PrincipalRESUMO
Non-negative matrix factorization (NMF) has become one of the most powerful methods for clustering and feature selection. However, the performance of the traditional NMF method severely degrades when the data contain noises and outliers or the manifold structure of the data is not taken into account. In this article, a novel method called correntropy-based hypergraph regularized NMF (CHNMF) is proposed to solve the above problem. Specifically, we use the correntropy instead of the Euclidean norm in the loss term of CHNMF, which will improve the robustness of the algorithm. And the hypergraph regularization term is also applied to the objective function, which can explore the high-order geometric information in more sample points. Then, the half-quadratic (HQ) optimization technique is adopted to solve the complex optimization problem of CHNMF. Finally, extensive experimental results on multi-cancer integrated data indicate that the proposed CHNMF method is superior to other state-of-the-art methods for clustering and feature selection.
Assuntos
Análise por Conglomerados , Biologia Computacional/métodos , Perfilação da Expressão Gênica/métodos , Aprendizado de Máquina , Neoplasias , Algoritmos , Bases de Dados Factuais , Humanos , Neoplasias/genética , Neoplasias/metabolismo , Neoplasias/patologiaRESUMO
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 L2,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.
Assuntos
Algoritmos , Biologia Computacional/métodos , Neoplasias , Bases de Dados Genéticas , Humanos , Neoplasias/classificação , Neoplasias/genéticaRESUMO
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.
Assuntos
Biologia Computacional/métodos , Perfilação da Expressão Gênica/métodos , Análise de Componente Principal , Algoritmos , Análise por Conglomerados , Bases de Dados Genéticas , Redes Reguladoras de Genes/genética , Humanos , Aprendizado de Máquina , Neoplasias/genéticaRESUMO
MicroRNAs (miRNAs) are dysregulated in many types of malignancies, including human hepatocellular carcinoma (HCC). MiR-107 has been implicated in several types of cancer regulation; however, relatively little is known about miR-107 in human HCC. In the present study, we showed that the overexpression of miR-107 accelerates the tumor progression of HCC in vitro and in vivo through its new target gene, CPEB3. Furthermore, our results demonstrated that CPEB3 is a newly discovered tumor suppressor that acts via the EGFR pathway. Therefore, our study demonstrates that the newly discovered miR-107/CPEB3/EGFR axis plays an important role in HCC progression and might represent a new potential therapeutic target for HCC treatment.