.png){kind=icon}
.png){kind=icon}
Return
Path-Aware Reasoning Network for document-level relation extraction with co-regularization loss
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2024.112931.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Document-level relation extraction (DocRE) aims to identify complicated relations among entity pairs in a document. It is challenging as a document usually has multiple entity pairs, and the two entities within a pair may also be scattered in a document with different entity-specific labels, even over along distance. Existing works usually focus on extracting crucial evidence sentences as a concise clue for relation inference. However, they suffer from two limitations: (1) indiscriminately utilizing all words in the sentences for relation inference may inevitably introduce noise problems (e.g., unrelated chunks/clauses involved), thus incurring a decline in performance. (2) they do not consider the noisy labeling phenomenon, as there exists a considerable amount of unlabeled instances in the DocRE scenario. To address the above issues, we propose a novel approach, named P ath-Aware R easoning N etwork (PARN) for DocRE. Specifically, PARN explicitly models the shortest inferring paths for each given entity pair over a word-level constructed document graph, and then incorporates a path-aware constraint into the self-attention mechanism, thereby directing the model's attention towards the crucial segments along these paths. Furthermore, a co-regularization loss is also proposed to alleviate the intrinsic noisy labeling problem, which increases the prediction consistency of the output. Extensive experiments on three DocRE datasets demonstrate the superiority of the proposed model, as compared to previous state-of-the-art methods.
Keywords:
Document-level relation extraction
Reasoning path
Key information detection
Journal
K
IF:
7.6
Papers:
1.2W
Citations:
4.5W
Organization
No organization information available