A Convolutional Neural Network With Time-Aware Channel Weighting for Temporal Knowledge Graph Completion

Temporal Knowledge Graphs (TKGs) extend traditional knowledge graphs by incorporating a temporal dimension into triples, enabling a more precise modeling of dynamic relationships. However, TKGs often face challenges, such as data sparsity and incomplete information in real-world applications, which can hinder their performance in downstream tasks. To address the limitations of existing static completion models in capturing temporal information, we propose a novel Temporal Knowledge Graph Completion model, Conv-TA (Convolutional Network with Time-Aware Channel Weighting). In this model, temporal embeddings are represented as the concatenation of three independent embeddings: year, month, and date. These embeddings are then processed through linear transformations to generate time-aware weights that dynamically adjust the significance of convolutional output channels. This design allows the model to effectively capture the complex and dynamic characteristics inherent in temporal relationships. We evaluate the effectiveness of the Conv-TA model on publicly available datasets, including ICEWS and GDELT. Experimental results demonstrate that Conv-TA achieves superior performance compared to existing baselines, highlighting its potential in addressing the challenges of temporal knowledge graph completion.

Authors

Institutions

Publication Details

Journal
IEEE Access
Published
2025-01-01
DOI
https://doi.org/10.1109/access.2025.3572357
Citations
1
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Convolutional Neural Network With Time-Aware Channel Weighting for Temporal Knowledge Graph Completion

Guige Ouyang, Kesheng Zhang, Yongzhong Huang
1 citations
IEEE Access
Advanced Graph Neural Networks
2.48
article

A Convolutional Neural Network With Time-Aware Channel Weighting for Temporal Knowledge Graph Completion

Guige Ouyang, Kesheng Zhang, Yongzhong Huang
article en
1 citations

Abstract

Temporal Knowledge Graphs (TKGs) extend traditional knowledge graphs by incorporating a temporal dimension into triples, enabling a more precise modeling of dynamic relationships. However, TKGs often face challenges, such as data sparsity and incomplete information in real-world applications, which can hinder their performance in downstream tasks. To address the limitations of existing static completion models in capturing temporal information, we propose a novel Temporal Knowledge Graph Completion model, Conv-TA (Convolutional Network with Time-Aware Channel Weighting). In this model, temporal embeddings are represented as the concatenation of three independent embeddings: year, month, and date. These embeddings are then processed through linear transformations to generate time-aware weights that dynamically adjust the significance of convolutional output channels. This design allows the model to effectively capture the complex and dynamic characteristics inherent in temporal relationships. We evaluate the effectiveness of the Conv-TA model on publicly available datasets, including ICEWS and GDELT. Experimental results demonstrate that Conv-TA achieves superior performance compared to existing baselines, highlighting its potential in addressing the challenges of temporal knowledge graph completion.

IEEE AccessVol. 13
Guilin University of Electronic Technology (CN)
Openalex Percentile: Top 10%
Advanced Graph Neural Networks
2.48
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.