Two Training Strategies for Improving Relation Extraction over Universal Graph

02/12/2021
by   Qin Dai, et al.
0

This paper explores how the Distantly Supervised Relation Extraction (DS-RE) can benefit from the use of a Universal Graph (UG), the combination of a Knowledge Graph (KG) and a large-scale text collection. A straightforward extension of a current state-of-the-art neural model for DS-RE with a UG may lead to degradation in performance. We first report that this degradation is associated with the difficulty in learning a UG and then propose two training strategies: (1) Path Type Adaptive Pretraining, which sequentially trains the model with different types of UG paths so as to prevent the reliance on a single type of UG path; and (2) Complexity Ranking Guided Attention mechanism, which restricts the attention span according to the complexity of a UG path so as to force the model to extract features not only from simple UG paths but also from complex ones. Experimental results on both biomedical and NYT10 datasets prove the robustness of our methods and achieve a new state-of-the-art result on the NYT10 dataset. The code and datasets used in this paper are available at https://github.com/baodaiqin/UGDSRE.

READ FULL TEXT
research
07/26/2021

How Knowledge Graph and Attention Help? A Quantitative Analysis into Bag-level Relation Extraction

Knowledge Graph (KG) and attention mechanism have been demonstrated effe...
research
06/03/2021

Discriminative Reasoning for Document-level Relation Extraction

Document-level relation extraction (DocRE) models generally use graph ne...
research
05/27/2021

Joint Biomedical Entity and Relation Extraction with Knowledge-Enhanced Collective Inference

Compared to the general news domain, information extraction (IE) from bi...
research
04/28/2021

Improving BERT Model Using Contrastive Learning for Biomedical Relation Extraction

Contrastive learning has been used to learn a high-quality representatio...
research
04/21/2020

Learning Relation Ties with a Force-Directed Graph in Distant Supervised Relation Extraction

Relation ties, defined as the correlation and mutual exclusion between d...
research
01/29/2018

Ensemble Neural Relation Extraction with Adaptive Boosting

Relation extraction has been widely studied to extract new relational fa...
research
11/30/2022

Open Relation and Event Type Discovery with Type Abstraction

Conventional closed-world information extraction (IE) approaches rely on...

Please sign up or login with your details

Forgot password? Click here to reset