DBGARE: Across-Within Dual Bipartite Graph Attention for Enhancing Distantly Supervised Relation Extraction
- Publisher:
- SPRINGER INTERNATIONAL PUBLISHING AG
- Publication Type:
- Conference Proceeding
- Citation:
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2022, 13368 LNAI, pp. 400-412
- Issue Date:
- 2022-01-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| DBGARE Across-Within Dual Bipartite Graph Attention for Enhancing Distantly Supervised Relation Extraction.pdf | Published version | 1.77 MB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
Recently, a kind of method based on single bipartite graph combined with single attention mechanism was proposed to solve the challenges of noisy labels and long-tailed distributions in distantly supervised relation extraction, which achieved competitive results. However, we argue that single bipartite graph will lose interactive information within each bipartite graph partition and single attention will cause attention bias. In order to improve the robustness of this method for noisy labels and long-tailed distributions, we propose a novel framework DBGARE, whereby graphs across and within each bipartite graph partition are constructed to enrich unbalanced relations dependency, based on which, a novel technique dual attention mechanism is devised to avoid attention bias and promote information dissemination from data-riches to data-poors. Multiple experiments on various widely-used real-world datasets show the state-of-the-art effectiveness of our framework in both challenges above. Furthermore, almost previous benchmark datasets are in English, we provide CIPDS ∗, a new Chinese dataset collected from Chinese Corpus in Chinese search engine, to expand distantly supervised relation extraction research field.
Please use this identifier to cite or link to this item: