首页 > 其他分享 >Graph regularized non-negative matrix factorization with [Formula: see text] norm regularization ter

Graph regularized non-negative matrix factorization with [Formula: see text] norm regularization ter

时间:2023-12-08 09:55:41浏览次数:39  
标签:non terms matrix regularization drug factorization

Graph regularized non-negative matrix factorization with [Formula: see text] norm regularization terms for drug-target interactions prediction

Junjun Zhang 1Minzhu Xie 2 3 Affiliations  Sign in Free PMC article

Abstract

Background: Identifying drug-target interactions (DTIs) plays a key role in drug development. Traditional wet experiments to identify DTIs are costly and time consuming. Effective computational methods to predict DTIs are useful to speed up the process of drug discovery. A variety of non-negativity matrix factorization based methods are proposed to predict DTIs, but most of them overlooked the sparsity of feature matrices and the convergence of adopted matrix factorization algorithms, therefore their performances can be further improved.

Results: In order to predict DTIs more accurately, we propose a novel method iPALM-DLMF. iPALM-DLMF models DTIs prediction as a problem of non-negative matrix factorization with graph dual regularization terms and [Formula: see text] norm regularization terms. The graph dual regularization terms are used to integrate the information from the drug similarity matrix and the target similarity matrix, and [Formula: see text] norm regularization terms are used to ensure the sparsity of the feature matrices obtained by non-negative matrix factorization. To solve the model, iPALM-DLMF adopts non-negative double singular value decomposition to initialize the nonnegative matrix factorization, and an inertial Proximal Alternating Linearized Minimization iterating process, which has been proved to converge to a KKT point, to obtain the final result of the matrix factorization. Extensive experimental results show that iPALM-DLMF has better performance than other state-of-the-art methods. In case studies, in 50 highest-scoring proteins targeted by the drug gabapentin predicted by iPALM-DLMF, 46 have been validated, and in 50 highest-scoring drugs targeting prostaglandin-endoperoxide synthase 2 predicted by iPALM-DLMF, 47 have been validated.

Keywords: Drug–target interactions; Inertial proximal alternating linearized minimization; norm.

标签:non,terms,matrix,regularization,drug,factorization
From: https://www.cnblogs.com/wangprince2017/p/17884524.html

相关文章

  • MatrixSSL
    MatrixSSL是针对小型应用程序和设备设计的嵌入式、开放源码SSLv3协议栈(商业版支持TLS协议)。它减少了将SSL整合进嵌入式工程的复杂性,使用一个简单的API和安全层,用户可以很容易地将MatrixSSL整合到它们的应用程序。Matrixssl使用工业界标准的加密算法(RC4、DES3、AES、......
  • ADO.Net DataAccess 常用方法ExecuteNonQuery ExecuteReader ExecuteDataSet
    1///<summary>2///Standardinterfacefordataaccessusingstoredprocedures3///</summary>4publicinterfaceIDataAccess5{6stringConnectionString{get;set;}7SqlConnectionCreateConnecti......
  • [ARC141D] Non-divisible Set 题解
    题目链接点击打开链接题目解法很思维的题,需要用好所有的特殊性质暴力的做法是建出图,然后求包含点\(i\)的最长反链,但这明显过不了上面的做法没用到\(a_i<2m\)的性质如何用?把\(a_i\)拆分成\(q\times2^k\;(k\)为奇数\()\)的形式,那么对于同一个\(q\),只能在其中选一个......
  • # 统计df的每一列中不为'None'的元素个数
    #统计df的每一列中不为'None'的元素个数importpandasaspd#创建一个DataFramedf=pd.DataFrame([[1,1,1],[2,2,'None']])df.columns=['col'+str(i)foriinrange(3)]#使用`apply()`和`lambda`函数统计每一列中不为'None'的元素......
  • LncDLSM: Identification of Long Non-coding RNAs with Deep Learning-based Sequenc
    关键词:作者:期刊:IEEEJournalofBiomedicalandHealthInformatics年份:2023论文原文:https://doi.org/10.1101/2022.09.02.506180主要内容1问题:长链非编码RNA(LncRNAs)在调控基因表达和其他生物过程中起着至关重要的作用。区分lncRNA和蛋白质编码转录本(PCTs)有助于研究人员深......
  • [AGC052C] Nondivisible Prefix Sums 题解
    题目链接点击打开链接题目解法好题!一个序列是不合法的,必定满足某些结论,我们不妨猜测一下首先如果和为\(P\)的倍数,必定不合法然后手玩几个可以发现,最极限的情况是\(P-1\)个\(1\;+\;\)\(b_i\;+\;\)\(P-b_i\)如果在这个情况下再加一个\(1\),就爆了其中\(1\)可以替......
  • matplotlib之matplotlib.pyplot.yticks(ticks=None, labels=None, **kwargs)函数
    matplotlib中的xticks函数用于设置坐标轴的刻度和标签,包括位置和显示的文本标签。matplotlib.pyplot.xticks(ticks=None,labels=None,**kwargs)ticks:刻度位置,可以是一个列表或数组。labels:刻度对应的标签,可以是一个列表或数组。**kwargs:其他关键字参数,用于控制......
  • Codeforces Round 829 (Div. 1)A1. Make Nonzero Sum (easy version)(思维找规律)
    先考虑无解的情况:当n为奇数时无解相邻的两个元素一定可以变成0\[a[i]!=a[i+1]时,分成[i,i],和[i+1,i+1]\]\[a[i]=a[i+1]时,分成[i,i+1]\]这两种情况对答案的贡献都是0,当n为奇数时我们总会有一个没办法凑成0.#include<bits/stdc++.h>#definelsp<<1#......
  • Mysql - Error 1055: Expression #1 of SELECT list is not in GROUP BY clause and c
    执行SQL时出现错误ERROR1055,SELECT列表不在GROUPBY语句内且存在不函数依赖GROUPBY语句的非聚合字段'edusassvc.u.nickname'这是和sql_mode=only_full_group_by不兼容的(即不支持)。分析问题1)原理层面这个错误会发生在mysql5.7版本及以上版本mysql5.7版本以上默认的sql......
  • P7626 [COCI2011-2012#1] MATRIX( 普及/提高− ) 题解
    题目传送门思路:首先思考暴力,\(O(n^4)\)的时间复杂度,不行。那么我们这里就要运用到一点前缀和的知识了。我们可以用前缀和对两条对角线进行计数。每个点有两个对角线运算。差不多是\(O(n^2)\)到\(O(n^3)\)的时间复杂度。而\(n\leq400\)稳过。Code:#include<bits/stdc......