Document-Level Relation Extraction With Low Entity Redundancy Feature Map
Document-level relation extraction (RE) aims to determine the relations between entities scattered across different sentences through reading and reasoning. Existing methods use semantic segmentation to obtain global information among triples by analyzing entity-level matrices. However, complete document input may introduce certain interference, making it challenging to express the underlying relationships. To address this, we propose a novel approach introducing a low-entity redundancy feature map, achieved by removing certain entities. The proposed optimal path filtering (OPF) selects entity-related sentences using heuristic rules and formulates sentence selection as a set cover problem, solved via backtracking pruning. U-Net is then applied to obtain global features. Our experiment achieves state-of-the-art results on two common document-level RE datasets, Re-DocRED and CDR, outperforming previous methods.
Authors
- Juanzi Li (ORCID: https://orcid.org/0000-0002-6244-0664)
- Jie Tang (ORCID: https://orcid.org/0000-0003-3487-4593)
- Lei Hou (ORCID: https://orcid.org/0000-0002-8907-3526)
- Depeng Dang (ORCID: https://orcid.org/0000-0001-7923-9329)
- Rongen Yan (ORCID: https://orcid.org/0000-0002-5107-4339)
- Keqin Peng (ORCID: https://orcid.org/0000-0002-5270-9439)
- Ye Tao (ORCID: https://orcid.org/0000-0003-1754-0874)
- Yakun Li
Institutions
- Beijing Normal University (CN)
- Beijing Forestry University (CN)
- University of Glasgow (GB)
- Tsinghua University (CN)
Publication Details
- Journal
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2025-09-09
- DOI
- https://doi.org/10.1109/tkde.2025.3607566
- Primary Topic
- Natural Language Processing Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.00