亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

EKGDR: An End-to-End Knowledge Graph-Based Method for Computational Drug Repurposing

重新调整用途 药物重新定位 端到端原则 计算机科学 图形 分类 药品 机器学习 药物发现 数据挖掘 人工智能 医学 生物信息学 理论计算机科学 生物 生态学 精神科
作者
Javad Tayebi,Bagher BabaAli
出处
期刊:Journal of Chemical Information and Modeling [American Chemical Society]
卷期号:64 (6): 1868-1881 被引量:7
标识
DOI:10.1021/acs.jcim.3c01925
摘要

The lengthy and expensive process of developing new drugs from scratch, coupled with a high failure rate, has prompted the emergence of drug repurposing/repositioning as a more efficient and cost-effective approach. This approach involves identifying new therapeutic applications for existing approved drugs, leveraging the extensive drug-related data already gathered. However, the diversity and heterogeneity of data, along with the limited availability of known drug-disease interactions, pose significant challenges to computational drug design. To address these challenges, this study introduces EKGDR, an end-to-end knowledge graph-based approach for computational drug repurposing. EKGDR utilizes the power of a drug knowledge graph, a comprehensive repository of drug-related information that encompasses known drug interactions and various categorization information, as well as structural molecular descriptors of drugs. EKGDR employs graph neural networks, a cutting-edge graph representation learning technique, to embed the drug knowledge graph (nodes and relations) in an end-to-end manner. By doing so, EKGDR can effectively learn the underlying causes (intents) behind drug-disease interactions and recursively aggregate and combine relational messages between nodes along different multihop neighborhood paths (relational paths). This process generates representations of disease and drug nodes, enabling EKGDR to predict the interaction probability for each drug-disease pair in an end-to-end manner. The obtained results demonstrate that EKGDR outperforms previous models in all three evaluation metrics: area under the receiver operating characteristic curve (AUROC = 0.9475), area under the precision-recall curve (AUPRC = 0.9490), and recall at the top-200 recommendations (Recall@200 = 0.8315). To further validate EKGDR's effectiveness, we evaluated the top-20 candidate drugs suggested for each of Alzheimer's and Parkinson's diseases.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
千里草完成签到,获得积分10
5秒前
量子星尘发布了新的文献求助10
13秒前
科研通AI5应助科研通管家采纳,获得10
1分钟前
1分钟前
李健的粉丝团团长应助lan采纳,获得10
2分钟前
量子星尘发布了新的文献求助10
2分钟前
2分钟前
lan完成签到,获得积分10
2分钟前
陈同学完成签到 ,获得积分10
2分钟前
lan发布了新的文献求助10
2分钟前
chen完成签到 ,获得积分10
2分钟前
sci2025opt完成签到 ,获得积分10
2分钟前
siv完成签到,获得积分10
2分钟前
科研通AI6应助懦弱的丹秋采纳,获得10
2分钟前
科研兵发布了新的文献求助10
3分钟前
天天快乐应助shee采纳,获得10
3分钟前
搜集达人应助科研兵采纳,获得10
3分钟前
insomnia417完成签到,获得积分0
3分钟前
量子星尘发布了新的文献求助10
4分钟前
4分钟前
5分钟前
5分钟前
5分钟前
上官若男应助科研通管家采纳,获得10
5分钟前
朴素易梦发布了新的文献求助30
5分钟前
5分钟前
6分钟前
6分钟前
科研通AI6应助懦弱的丹秋采纳,获得10
6分钟前
量子星尘发布了新的文献求助10
6分钟前
6分钟前
7分钟前
科研通AI2S应助科研通管家采纳,获得10
7分钟前
bkagyin应助科研通管家采纳,获得10
7分钟前
聪明的云完成签到 ,获得积分10
7分钟前
8分钟前
量子星尘发布了新的文献求助10
8分钟前
朴素易梦完成签到,获得积分10
8分钟前
小马甲应助John采纳,获得10
9分钟前
kuoping完成签到,获得积分0
9分钟前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
计划经济时代的工厂管理与工人状况(1949-1966)——以郑州市国营工厂为例 500
Comparison of spinal anesthesia and general anesthesia in total hip and total knee arthroplasty: a meta-analysis and systematic review 500
INQUIRY-BASED PEDAGOGY TO SUPPORT STEM LEARNING AND 21ST CENTURY SKILLS: PREPARING NEW TEACHERS TO IMPLEMENT PROJECT AND PROBLEM-BASED LEARNING 500
Modern Britain, 1750 to the Present (第2版) 300
Writing to the Rhythm of Labor Cultural Politics of the Chinese Revolution, 1942–1976 300
Lightning Wires: The Telegraph and China's Technological Modernization, 1860-1890 250
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 纳米技术 计算机科学 内科学 化学工程 复合材料 物理化学 基因 催化作用 遗传学 冶金 电极 光电子学
热门帖子
关注 科研通微信公众号,转发送积分 4596189
求助须知:如何正确求助?哪些是违规求助? 4008262
关于积分的说明 12409027
捐赠科研通 3687193
什么是DOI,文献DOI怎么找? 2032271
邀请新用户注册赠送积分活动 1065522
科研通“疑难数据库(出版商)”最低求助积分说明 950827