mlsanityData to 7 Oct 2026

Towards Pattern-aware Data Augmentation for Temporal Knowledge Graph Completion

arXiv 2501.00252 ↗First posted 31 Dec 2024cs.LG cs.DB cs.IRcited by 0

Not on the map. Why?

Abstract (arXiv)

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 or 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.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 24 of its 65 references that are in the map. First posted on arXiv 31 Dec 2024.

Builds on

24 of 65 references.

References · 24

  1. 2021Self-Supervised Learning of Graph Neural Networks: A Unified Reviewcited by 184
  2. 2018Learning Sequence Encoders for Temporal Knowledge Graph Completioncited by 145
  3. 2022G-Mixup: Graph Data Augmentation for Graph Classificationcited by 145
  4. 2022Data Augmentation for Deep Graph Learning: A Surveycited by 132
  5. 2020Tensor Decompositions for temporal knowledge base completioncited by 115
  6. 2021An Empirical Study of Graph Contrastive Learningcited by 113
  7. 2021Temporal Knowledge Graph Reasoning Based on Evolutional Representation Learningcited by 106
  8. 2019Diachronic Embedding for Temporal Knowledge Graph Completioncited by 104
  9. 2020TeMP: Temporal Message Passing for Temporal Knowledge Graph Completioncited by 61
  10. 2022Temporal Knowledge Graph Reasoning with Historical Contrastive Learningcited by 42
  11. 2022Confidence May Cheat: Self-Training on Graph Neural Networks under Distribution Shiftcited by 38
  12. 2022Unleashing the Power of Graph Data Augmentation on Covariate Distribution Shiftcited by 38
12 more
  1. 2020Temporal Knowledge Base Completion: New Algorithms and Evaluation Protocolscited by 30
  2. 2023GraphPatcher: Mitigating Degree Bias for Graph Neural Networks via Test-time Augmentationcited by 29
  3. 2024TILP: Differentiable Learning of Temporal Logical Rules on Knowledge Graphscited by 21
  4. 2023Toward Degree Bias in Embedding-Based Knowledge Graph Completioncited by 17
  5. 2023Localised Adaptive Spatial-Temporal Graph Neural Networkcited by 14
  6. 2022Positive-Unlabeled Learning with Adversarial Data Augmentation for Knowledge Graph Completioncited by 13
  7. 2023Knowledge Graph Completion with Counterfactual Augmentationcited by 13
  8. 2022Comprehensive Analysis of Negative Sampling in Knowledge Graph Representation Learningcited by 12
  9. 2021Time-aware Path Reasoning on Knowledge Graph for Recommendationcited by 11
  10. 2024Negative Sampling in Knowledge Graph Representation Learning: A Reviewcited by 9
  11. 2022Spatio-Temporal Contrastive Learning Enhanced GNNs for Session-based Recommendationcited by 8
  12. 2024RevGNN: Negative Sampling Enhanced Contrastive Graph Learning for Academic Reviewer Recommendationcited by 8

Built on by

Not cited yet.