Learning Relation Ties with a Force-Directed Graph in Distant Supervised Relation Extraction
Yuming Shang, Heyan Huang, Xin Sun, Xianling Mao

TL;DR
This paper introduces a novel force-directed graph model for distant supervised relation extraction that captures global relation ties using physics-inspired forces, significantly improving extraction accuracy.
Contribution
It proposes a global topology-aware relation extraction model using Coulomb's Law inspired forces, outperforming local dependency-based methods.
Findings
Model captures global relation ties effectively.
Significant performance improvement over baselines.
Force-directed graph enhances existing systems.
Abstract
Relation ties, defined as the correlation and mutual exclusion between different relations, are critical for distant supervised relation extraction. Existing approaches model this property by greedily learning local dependencies. However, they are essentially limited by failing to capture the global topology structure of relation ties. As a result, they may easily fall into a locally optimal solution. To solve this problem, in this paper, we propose a novel force-directed graph based relation extraction model to comprehensively learn relation ties. Specifically, we first build a graph according to the global co-occurrence of relations. Then, we borrow the idea of Coulomb's Law from physics and introduce the concept of attractive force and repulsive force to this graph to learn correlation and mutual exclusion between relations. Finally, the obtained relation representations are applied…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopic Modeling · Text and Document Classification Technologies · Natural Language Processing Techniques
