Heterogeneous Graph Path Reasoning Based Document-Level Relation Extraction for Equipment Domains

Document-level relation extraction is one of the foundational tasks for constructing an equipment domain knowledge graph. However, existing document-level relation extraction models in the equipment domain face the following challenges: (1) Most employ implicit logic reasoning mechanisms with poor interpretability, lacking explicit modeling of reasoning processes, which results in suboptimal performance for extracting long-distance and complex relations. (2) They do not consider the issue of long-tailed relations caused by imbalanced label distributions. To address these challenges, this paper proposes a document-level relation extraction model based on heterogeneous graph path reasoning. For the long-distance and complex relations present in documents, the model constructs three types of reasoning paths: continuous paths, multi-hop paths, and default paths, to explicitly model the reasoning phenomena within documents. By integrating entity embeddings with the reasoning path features, the model enhances performance in extracting longdistance and complex relations. The adaptive focal loss function is employed to balance positive and negative relations, focusing on low-confidence samples to optimize the extraction performance of long-tail relations. Experimental results on both the public dataset DocRED and the self-constructed DLDED dataset demonstrate that the proposed model outperforms common baseline models such as TDGAT.

Authors

Institutions

Publication Details

Published
2024-10-25
DOI
https://doi.org/10.1109/icbaie63306.2024.11116945
Primary Topic
Natural Language Processing Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Heterogeneous Graph Path Reasoning Based Document-Level Relation Extraction for Equipment Domains

Xiulei Liu, Lin Miao, Jinchang Ren, Xuhong Liu
Natural Language Processing Techniques
article

Heterogeneous Graph Path Reasoning Based Document-Level Relation Extraction for Equipment Domains

Xiulei Liu, Lin Miao, Jinchang Ren, Xuhong Liu
article en

Abstract

Document-level relation extraction is one of the foundational tasks for constructing an equipment domain knowledge graph. However, existing document-level relation extraction models in the equipment domain face the following challenges: (1) Most employ implicit logic reasoning mechanisms with poor interpretability, lacking explicit modeling of reasoning processes, which results in suboptimal performance for extracting long-distance and complex relations. (2) They do not consider the issue of long-tailed relations caused by imbalanced label distributions. To address these challenges, this paper proposes a document-level relation extraction model based on heterogeneous graph path reasoning. For the long-distance and complex relations present in documents, the model constructs three types of reasoning paths: continuous paths, multi-hop paths, and default paths, to explicitly model the reasoning phenomena within documents. By integrating entity embeddings with the reasoning path features, the model enhances performance in extracting longdistance and complex relations. The adaptive focal loss function is employed to balance positive and negative relations, focusing on low-confidence samples to optimize the extraction performance of long-tail relations. Experimental results on both the public dataset DocRED and the self-constructed DLDED dataset demonstrate that the proposed model outperforms common baseline models such as TDGAT.

Beijing Information Science & Technology University (CN)
Openalex Percentile: Top 72%
Natural Language Processing Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.