.png){kind=icon}
.png){kind=icon}
Return
Learning Relation Ties with a Force-Directed Graph in Distant Supervised Relation Extraction
.png){kind=icon}
OA
AI
DOI：10.1145/3520082.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 amodule to augment existing relation extraction systems and improve their performance.
Keywords:
Distant supervision
relation extraction
relation ties
force-directed graph
Journal
IF:
9.1
Papers:
1.2K
Citations:
4.7K