.png){kind=icon}
Return
Distantly-Supervised Long-Tailed Relation Extraction Using Constraint Graphs
.png){kind=icon}
OA
AI
DOI：10.1109/TKDE.2022.3177226.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Label noise and long-tailed distributions are two major challenges in distantly supervised relation extraction. Recent studies have shown great progress on denoising, but paid little attention to the problem of long-tailed relations. In this paper, we introduce a constraint graph to model the dependencies between relation labels. On top of that, we further propose a novel constraint graph-based relation extraction framework(CGRE) to handle the two challenges simultaneously. CGRE employs graph convolution networks to propagate information from data-rich relation nodes to data-poor relation nodes, and thus boosts the representation learning of long-tailed relations. To further improve the noise immunity, a constraint-aware attention module is designed in CGRE to integrate the constraint information. Extensive experimental results indicate that CGRE achieves significant improvements over the previous methods for both denoising and long-tailed relation extraction.
Keywords:
Relation extraction
distant supervision
multi-instance learning
label noise
long tail
Journal
IF:
10.4
Papers:
6.9K
Citations:
3.2W
Organization
View more organizations
Cited Papers
ShareSave
ShareSaveThe Source, Spatial Distribution and Risk Assessment of Heavy Metals in Soil from the Pearl River Delta Based on the National Multi-Purpose Regional Geochemical Survey.png)
PLOS ONEOAAI
PLOS ONEIF0
OAAIShareSaveShareSave View more