Towards Pattern-aware Data Augmentation for Temporal Knowledge Graph Completion
Jiasheng Zhang, Deqiang Ouyang, Shuang Liang, Jie Shao
Abstract
Predicting missing facts for temporal knowledge graphs (TKGs) is a fundamental task, called temporal knowledge graph completion (TKGC). One key challenge in this task is the imbalance in data distribution, where facts are unevenly spread across entities and timestamps. This imbalance can lead to poor completion performance for long-tail entities and timestamps, and unstable training due to the introduction of false negative samples. Unfortunately, few previous studies have investigated how to mitigate these effects. Moreover, for the first time, we found that existing methods suffer from model preferences, revealing that entities with specific properties (e.g., recently active) are favored by different models. Such preferences will lead to error accumulation and further exacerbate the effects of imbalanced data distribution, but are overlooked by previous studies. To alleviate the impacts of imbalanced data and model preferences, we introduce Booster, the first data augmentation strategy for TKGs. The unique requirements here lie in generating new samples that fit the complex semantic and temporal patterns within TKGs, and identifying hard-learning samples specific to models. Therefore, we propose a hierarchical scoring algorithm based on triadic closures within TKGs. By incorporating both global semantic patterns and local time-aware structures, the algorithm enables pattern-aware validation for new samples. Meanwhile, we propose a two-stage training approach to identify samples that deviate from the model's preferred patterns. With a well-designed frequency-based filtering strategy, this approach also helps to avoid the misleading of false negatives. Experiments justify that Booster can seamlessly adapt to existing TKGC models and achieve up to an 8.7% performance improvement.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 00af8cc6-b768-49a3-98e3-645a79676ec7Cited by top-tier papers1
Ask how each one uses itBuilds on22
- Diachronic Embedding for Temporal Knowledge Graph CompletionRishab Goel, Seyed Mehran Kazemi, Marcus A. Brubaker, Pascal PoupartAAAI 2020 · 423 citations
- Temporal Knowledge Graph Reasoning Based on Evolutional Representation LearningZixuan Li, Xiaolong Jin, Wei Li, Saiping Guan et al.SIGIR 2021 · 345 citations
- Tensor Decompositions for Temporal Knowledge Base CompletionTimothée Lacroix, Guillaume Obozinski, Nicolas UsunierICLR 2020 · 341 citations
- G-Mixup: Graph Data Augmentation for Graph ClassificationXiaotian Han, Zhimeng Jiang, Ninghao Liu, Xia HuICML 2022 · 251 citations
- Explainable Subgraph Reasoning for Forecasting on Temporal Knowledge GraphsZhen Han, Peng Chen, Yunpu Ma, Volker TrespICLR 2021 · 213 citations
Related papers
- TeMP: Temporal Message Passing for Temporal Knowledge Graph CompletionJiapeng Wu, Meng Cao, Jackie Chi Kit Cheung, William L. HamiltonEMNLP 2020 · 137 citations
- Temporal Knowledge Graph Completion Using Box EmbeddingsJohannes Messner, Ralph Abboud, Ismail Ilkan CeylanAAAI 2022 · 138 citations
- TiRano: Tensorized Relation-aware Temporal Reasoning for Accurate Knowledge Graph CompletionSeungJoo Lee, Yong-chan Park, U. KangKDD 2026
- Subgraph-Aware Training of Language Models for Knowledge Graph Completion Using Structure-Aware Contrastive LearningYoumin Ko, Hyemin Yang, Taeuk Kim, Hyunjoon KimWWW 2025 · 10 citations
- Learning to Walk across Time for Interpretable Temporal Knowledge Graph CompletionJaehun Jung, Jinhong Jung, U KangKDD 2021 · 93 citations
