Improving Embeddings by Refining Meanings for Temporal Knowledge Graph Link Predictions

Temporal Knowledge Graphs (TKGs) represent real-life facts using entities, relational types, and timestamps where relational types state the semantic scenario of facts. Current methods learn embeddings by merging facts of multiple types (e.g. sport and family) for predictions. Such embeddings associate well with relations of multiple types. However, the prediction needs only information of a single type, i.e. embeddings contain irrelevant relational types. In this paper, we explore whether embeddings with irrelevant information confuse predictions and propose RefE to improve embeddings by refining meanings. RefE enhances the ability for predicting links of a specific type while maintaining associations of multiple relational types. RefE consists of general learning and embedding refining modules. General learning embeds facts of multiple types to represent general meanings, and embedding refining emphasizes facts of the single type that matches the prediction. RefE uses both general and refined embeddings for predictions. Experimental results on four datasets verify the effectiveness of RefE.

Authors

Institutions

Publication Details

Published
2025-03-12
DOI
https://doi.org/10.1109/icassp49660.2025.10890332
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Improving Embeddings by Refining Meanings for Temporal Knowledge Graph Link Predictions

Qiannan Zhu, Xiaofei Zhou, Linhua Dong, Xu Bai et al.
Advanced Graph Neural Networks
article

Improving Embeddings by Refining Meanings for Temporal Knowledge Graph Link Predictions

Qiannan Zhu, Xiaofei Zhou, Linhua Dong, Xu Bai, Gang Xiong
article en

Abstract

Temporal Knowledge Graphs (TKGs) represent real-life facts using entities, relational types, and timestamps where relational types state the semantic scenario of facts. Current methods learn embeddings by merging facts of multiple types (e.g. sport and family) for predictions. Such embeddings associate well with relations of multiple types. However, the prediction needs only information of a single type, i.e. embeddings contain irrelevant relational types. In this paper, we explore whether embeddings with irrelevant information confuse predictions and propose RefE to improve embeddings by refining meanings. RefE enhances the ability for predicting links of a specific type while maintaining associations of multiple relational types. RefE consists of general learning and embedding refining modules. General learning embeds facts of multiple types to represent general meanings, and embedding refining emphasizes facts of the single type that matches the prediction. RefE uses both general and refined embeddings for predictions. Experimental results on four datasets verify the effectiveness of RefE.

Chinese Academy of Sciences (CN), Beijing Normal University (CN), Institute of Information Engineering (CN)
Openalex Percentile: Top 98%
Advanced Graph Neural Networks
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.