Enhanced Heterogeneous Graph Attention Network with a Novel Multilabel Focal Loss for Document-Level Relation Extraction
Author:
Chen Yang1ORCID, Shi Bowen2
Affiliation:
1. State Key Lab of Software Development Environment, Beihang University, Beijing 100191, China 2. School of Journalism, Communication University of China, Beijing 100024, China
Abstract
Recent years have seen a rise in interest in document-level relation extraction, which is defined as extracting all relations between entities in multiple sentences of a document. Typically, there are multiple mentions corresponding to a single entity in this context. Previous research predominantly employed a holistic representation for each entity to predict relations, but this approach often overlooks valuable information contained in fine-grained entity mentions. We contend that relation prediction and inference should be grounded in specific entity mentions rather than abstract entity concepts. To address this, our paper proposes a two-stage mention-level framework based on an enhanced heterogeneous graph attention network for document-level relation extraction. Our framework employs two different strategies to model intra-sentential and inter-sentential relations between fine-grained entity mentions, yielding local mention representations for intra-sentential relation prediction and global mention representations for inter-sentential relation prediction. For inter-sentential relation prediction and inference, we propose an enhanced heterogeneous graph attention network to better model the long-distance semantic relationships and design an entity-coreference path-based inference strategy to conduct relation inference. Moreover, we introduce a novel cross-entropy-based multilabel focal loss function to address the class imbalance problem and multilabel prediction simultaneously. Comprehensive experiments have been conducted to verify the effectiveness of our framework. Experimental results show that our approach significantly outperforms the existing methods.
Funder
Fundamental Research Funds for the Central Universities
Reference39 articles.
1. Song, Y., Li, W., Dai, G., and Shang, X. (2023). Advancements in Complex Knowledge Graph Question Answering: A Survey. Electronics, 12. 2. Wei, S., Liang, Y., Li, X., Weng, X., Fu, J., and Han, X. (2023). Chinese Few-Shot Named Entity Recognition and Knowledge Graph Construction in Managed Pressure Drilling Domain. Entropy, 25. 3. Tian, H., Zhang, X., Wang, Y., and Zeng, D. (2022). Multi-task learning and improved TextRank for knowledge graph completion. Entropy, 24. 4. Xu, J., Chen, Y., Qin, Y., Huang, R., and Zheng, Q. (2021). A feature combination-based graph convolutional neural network model for relation extraction. Symmetry, 13. 5. Verga, P., Strubell, E., and McCallum, A. (2018). Simultaneously self-attending to all mentions for full-abstract biological relation extraction. arXiv.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
|
|