arrow
Return

Text-augmented long-term relation dependency learning for knowledge graph representation

delete2025-04-01
delete0
delete
OA
AI
Q
Quntao Zhu
李梦凡 (Mengfan Li)
Y
Y. Gao
Y
Yao Wan
X
Xuanhua Shi *
H
Hai Jin
DOI:10.1016/j.hcc.2025.100315delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Knowledge graph (KG) representation learning aims to map entities and relations into a low-dimensional representation space, showing significant potential in many tasks. Existing approaches follow two categories: (1) Graph-based approaches encode KG elements into vectors using structural score functions. (2) Text-based approaches embed text descriptions of entities and relations via pre-trained language models (PLMs), further fine-tuned with triples. We argue that graph-based approaches struggle with sparse data, while text-based approaches face challenges with complex relations. To address these limitations, we propose a unified Text-Augmented Attention-based Recurrent Network, bridging the gap between graph and natural language. Specifically, we employ a graph attention network based on local influence weights to model local structural information and utilize a PLM based prompt learning to learn textual information, enhanced by a mask-reconstruction strategy based on global influence weights and textual contrastive learning for improved robustness and generalizability. Besides, to effectively model multi-hop relations, we propose a novel semantic-depth guided path extraction algorithm and integrate cross-attention layers into recurrent neural networks to facilitate learning the long-term relation dependency and offer an adaptive attention mechanism for varied-length information. Extensive experiments demonstrate that our model exhibits superiority over existing models across KG completion and question-answering tasks.
Keywords:
Knowledge graph representation
Graph attention network
Pre-trained language model
Attention-based recurrent network
Masked autoencoder
Contrastive learning
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

H
High-Confidence Computing
IF:
3
Papers:
243
Citations:
407

Organization

No organization information available