首页> 外文会议>IEEE International Conference on Bioinformatics and Biomedicine >Robust graph regularized sparse orthogonal nonnegative matrix factorization for identifying differentially expressed genes
【24h】

Robust graph regularized sparse orthogonal nonnegative matrix factorization for identifying differentially expressed genes

机译:鲁棒图正则化稀疏正交非负矩阵分解以识别差异表达基因

获取原文

摘要

With the advent of sequencing technology, numerous gene expression data are generated. Identifying differentially expressed genes play an important role in the gene therapy of cancer patients. As an useful mathematical tool, nonnegative matrix factorization (NMF) has been successfully used for identifying differentially expressed genes. In this paper, a novel method named robust graph regularized sparse orthogonal nonnegative matrix factorization (RGSON) is proposed and used for identifying differentially expressed genes, which introduces manifold learning, L1 and orthogonal constraints into the objective function. In particular, L2,1-norm minimization is enforced on the objective function to improve the robustness of the algorithm. To prove the validity of the algorithm, experiments on the real genomic dataset are conducted. The results show that RGSON performs more effective than many other methods for identifying differentially expressed genes.
机译:随着测序技术的出现,产生了许多基因表达数据。鉴定差异表达的基因在癌症患者的基因治疗中起着重要作用。作为一种有用的数学工具,非负矩阵分解(NMF)已成功用于鉴定差异表达的基因。提出了一种鲁棒图正则化的稀疏正交非负矩阵分解方法(RGSON),并将其用于识别差异表达基因,该方法将流形学习,L 1 和正交约束引入目标函数。 。特别地,在目标函数上强制执行L 2,1 -范数最小化,以提高算法的鲁棒性。为了证明该算法的有效性,对真实的基因组数据集进行了实验。结果表明,RGSON在鉴定差异表达基因方面比许多其他方法更有效。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号