Robust nonnegative matrix factorization via joint graph Laplacian and discriminative information for identifying differentially expressed genes
Summary: Differential expression plays an important role in cancer diagnosis and classification. In recent years, many methods have been used to identify differentially expressed genes. However, the recognition rate and reliability of gene selection still need to be improved. In this paper, a novel constrained method named robust nonnegative matrix factorization via joint graph Laplacian and discriminative information (GLD-RNMF) is proposed for identifying differentially expressed genes, in which manifold learning and the discriminative label information are incorporated into the traditional nonnegative matrix factorization model to train the objective matrix. Specifically, \(L_{2,1}\)-norm minimization is enforced on both the error function and the regularization term which is robust to outliers and noise in gene data. Furthermore, the multiplicative update rules and the details of convergence proof are shown for the new model. The experimental results on two publicly available cancer datasets demonstrate that GLD-RNMF is an effective method for identifying differentially expressed genes.
- Joint nonnegative matrix factorization based on sparse and graph Laplacian regularization for clustering and co-differential expression genes analysis
- Non-negative matrix factorization and its applications to gene expression data analysis
- Hypergraph regularized discriminative nonnegative matrix factorization on sample classification and co-differentially expressed gene selection
- Class Discovery via Nonnegative Matrix Factorization
- Identification of differentially expressed genes in high-density oligonucleotide arrays accounting for the quantification limits of the technology
- Clustering and feature selection using sparse principal component analysis
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- Manifold Regularized Discriminative Nonnegative Matrix Factorization With Fast Gradient Descent
- Non-negative matrix factorization with sparseness constraints
- Solving quasi-variational inequalities via their KKT conditions
- A new robust classifier on noise domains: bagging of Credal C4.5 trees
- Geometric structure guided model and algorithms for complete deconvolution of gene expression data
- Joint nonnegative matrix factorization based on sparse and graph Laplacian regularization for clustering and co-differential expression genes analysis
- Intelligent phenotype-detection and gene expression profile generation with generative adversarial networks
This page was built for publication: Robust nonnegative matrix factorization via joint graph Laplacian and discriminative information for identifying differentially expressed genes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012798)
