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

Yu Ming Shang, Heyan Huang, Xin Sun, Wei Wei, Xian Ling Mao*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)

Abstract

Relation ties, defined as the correlation and mutual exclusion between different relations, are critical for distant supervised relation extraction. Previous studies usually obtain this property by greedily learning the local connections between relations. However, they are essentially limited because of failing to capture the global topology structure of relation ties and may easily fall into a locally optimal solution. To address this issue, we propose a novel force-directed graph to comprehensively learn relation ties. Specifically, we first construct a graph according to the global co-occurrence of all relations. Then, we borrow the idea of Coulomb's law from physics and introduce the concept of attractive force and repulsive force into this graph to learn correlation and mutual exclusion between relations. Finally, the obtained relation representations are applied as an inter-dependent relation classifier. Extensive experimental results demonstrate that our method is capable of modeling global correlation and mutual exclusion between relations, and outperforms the state-of-The-Art baselines. In addition, the proposed force-directed graph can be used as a module to augment existing relation extraction systems and improve their performance.

Original languageEnglish
Article number10
JournalACM Transactions on Information Systems
Volume41
Issue number1
DOIs
Publication statusPublished - 9 Jan 2023

Keywords

  • Distant supervision
  • force-directed graph
  • relation extraction
  • relation ties

Fingerprint

Dive into the research topics of 'Learning Relation Ties with a Force-Directed Graph in Distant Supervised Relation Extraction'. Together they form a unique fingerprint.

Cite this