已入深夜,您辛苦了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!祝你早点完成任务,早点休息,好梦!

Extracting Drug-drug Interactions from Biomedical Texts using Knowledge Graph Embeddings and Multi-focal Loss

计算机科学 人工智能 Softmax函数 特征(语言学) 图形 判决 分类器(UML) 特征学习 依存语法 短语 自然语言处理 人工神经网络 嵌入 解析 模式识别(心理学) 理论计算机科学 哲学 语言学
作者
Xin Jin,Xia Sun,Jiacheng Chen,Richard F. E. Sutcliffe
标识
DOI:10.1145/3511808.3557318
摘要

The field of Drug-drug interaction (DDI) aims to detect descriptions of interactions between drugs from biomedical texts. Currently, researchers have extracted DDIs using pre-trained language models such as BERT, which often misclassify two kinds of DDI types, "Effect" and "Int", on the DDIExtraction 2013 corpus because of highly similar expressions. The use of knowledge graphs can alleviate this problem by incorporating different relationships for each, thus allowing them to be distinguished. Thus, we propose a novel framework to integrate the neural network with a knowledge graph, where the features from these components are complementary. Specifically, we take text features at different levels into account in the neural network part. This is done by firstly obtaining a word-level position feature using PubMedBERT together with a convolution neural network, secondly, getting a phrase-level key path feature using a dependency parsing tree, thirdly, using PubMedBERT with an attention mechanism to obtain a sentence-level language feature, and finally, fusing these three kinds of representation into a synthesized feature. We also extract a knowledge feature from a drug knowledge graph which takes just a few minutes to construct, then concatenate the synthesized feature with the knowledge feature, feed the result into a multi-layer perceptron and obtain the result by a softmax classifier. In order to achieve a good integration of the synthesized feature and the knowledge feature, we train the model using a novel multifocal loss function, KGE-MFL, which is based on a knowledge graph embedding. Finally we attain state-of-the-art results on the DDIExtraction 2013 dataset (micro F-score 86.24%) and on the ChemProt dataset (micro F-score 77.75%), which proves our framework to be effective for biomedical relation extraction tasks. In particular, we fill the performance gap (more than 5.57%) between methods that rely on and do not rely on knowledge graph embedding on the DDIExtraction 2013 corpus, when predicting the "Int" type. The implementation code is available at https://github.com/NWU-IPMI/DDIE-KGE-MFL.
最长约 10秒,即可获得该文献文件

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

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
pwq发布了新的文献求助10
2秒前
nini发布了新的文献求助10
2秒前
一一完成签到,获得积分10
3秒前
汉堡包应助威武小猫咪采纳,获得10
6秒前
6秒前
10秒前
菜鸡游泳发布了新的文献求助10
11秒前
SiO2完成签到 ,获得积分0
12秒前
12秒前
君寻完成签到 ,获得积分10
13秒前
13秒前
13秒前
小蘑菇应助babalababa采纳,获得10
14秒前
14秒前
15秒前
中标发布了新的文献求助10
17秒前
17秒前
17秒前
公西凝芙发布了新的文献求助10
19秒前
21秒前
22秒前
22秒前
22秒前
Royal耗子完成签到,获得积分10
24秒前
haobhaobhaob发布了新的文献求助10
25秒前
26秒前
科研通AI5应助豆豆可采纳,获得10
26秒前
27秒前
Royal耗子发布了新的文献求助10
27秒前
慕青应助诺贝尔一直讲采纳,获得30
28秒前
公西凝芙完成签到,获得积分10
28秒前
科研通AI6应助弎夜采纳,获得30
28秒前
langqi发布了新的文献求助10
29秒前
Miya发布了新的文献求助30
29秒前
30秒前
haobhaobhaob完成签到,获得积分10
32秒前
凯蒂发布了新的文献求助10
33秒前
35秒前
哎健身发布了新的文献求助10
37秒前
量子星尘发布了新的文献求助10
37秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
网络安全 SEMI 标准 ( SEMI E187, SEMI E188 and SEMI E191.) 1000
计划经济时代的工厂管理与工人状况(1949-1966)——以郑州市国营工厂为例 500
INQUIRY-BASED PEDAGOGY TO SUPPORT STEM LEARNING AND 21ST CENTURY SKILLS: PREPARING NEW TEACHERS TO IMPLEMENT PROJECT AND PROBLEM-BASED LEARNING 500
The Pedagogical Leadership in the Early Years (PLEY) Quality Rating Scale 410
Why America Can't Retrench (And How it Might) 400
Two New β-Class Milbemycins from Streptomyces bingchenggensis: Fermentation, Isolation, Structure Elucidation and Biological Properties 300
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 纳米技术 计算机科学 内科学 化学工程 复合材料 物理化学 基因 催化作用 遗传学 冶金 电极 光电子学
热门帖子
关注 科研通微信公众号,转发送积分 4610031
求助须知:如何正确求助?哪些是违规求助? 4016179
关于积分的说明 12434575
捐赠科研通 3697585
什么是DOI,文献DOI怎么找? 2038909
邀请新用户注册赠送积分活动 1071843
科研通“疑难数据库(出版商)”最低求助积分说明 955542