Denoising Graph Inference Network for Document-Level Relation Extraction

作     者：Hailin Wang Ke Qin Guiduo Duan Guangchun Luo 

作者机构：School of Computer Science and EngineeringUniversity of Electronic Science and Technology of ChinaChengdu 611731China School of Computing and Artificial IntelligenceSouthwestern University of Finance and EconomicsChengdu 611130China 

出 版 物：《Big Data Mining and Analytics》 (大数据挖掘与分析（英文）)

年 卷 期：2023年第6卷第2期

页      面：248-262页

核心收录：

学科分类：08[工学] 081104[工学-模式识别与智能系统] 0811[工学-控制科学与工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported by the National Natural Science Foundation of China(Nos.U19A2059&62176046). 

主　　题：Relation Eextraction(RE) document-level denoising linguistic knowledge attention mechanism 

摘      要：Relation Extraction(RE)is to obtain a predefined relation type of two entities mentioned in a piece of text,e.g.,a sentence-level or a document-level text.Most existing studies suffer from the noise in the text,and necessary pruning is of great importance.The conventional sentence-level RE task addresses this issue by a denoising method using the shortest dependency path to build a long-range semantic dependency between entity pairs.However,this kind of denoising method is scarce in document-level RE.In this work,we explicitly model a denoised document-level graph based on linguistic knowledge to capture various long-range semantic dependencies among entities.We first formalize a Syntactic Dependency Tree forest(SDT-forest)by introducing the syntax and discourse dependency relation.Then,the Steiner tree algorithm extracts a mention-level denoised graph,Steiner Graph(SG),removing linguistically irrelevant words from the SDT-forest.We then devise a slide residual attention to highlight word-level evidence on text and SG.Finally,the classification is established on the SG to infer the relations of entity pairs.We conduct extensive experiments on three public datasets.The results evidence that our method is beneficial to establish long-range semantic dependency and can improve the classification performance with longer texts.