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. The pre-processed datasets and source code are publicly available at https://github.com/tmliang/CGRE.
翻译:在远程监控关系提取过程中,Label噪音和长尾号分布是两大挑战。最近的研究显示,在解密方面取得了很大进展,但很少注意长尾关系问题。在本文中,我们引入了一个制约图,以模拟关系标签之间的依赖关系。此外,我们进一步提议建立一个新的制约图形关系提取框架(CGRE),以同时处理这两个挑战。CGRE使用图解变动网络,从数据丰富的关系节点到数据贫乏关系节点,传播信息,从而推动长期关系的代表性学习。为了进一步改善噪音豁免,CGREE设计了一个约束意识关注模块,以整合制约信息。广泛的实验结果表明,CGRE在以往的解密和长尾号关系提取方法上都取得了显著改进。预处理的数据集和源代码可在https://github.com/tmliang/CGRE上公开查阅。