Temporal Knowledge Graph Reasoning with Historical Contrastive Learning

被引:0
|
作者
Xu, Yi [1 ]
Ou, Junjie [1 ]
Xu, Hui [1 ]
Fu, Luoyi [1 ]
机构
[1] Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, Shanghai, Peoples R China
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Temporal knowledge graph, serving as an effective way to store and model dynamic relations, shows promising prospects in event forecasting. However, most temporal knowledge graph reasoning methods are highly dependent on the recurrence or periodicity of events, which brings challenges to inferring future events related to entities that lack historical interaction. In fact, the current moment is often the combined effect of a small part of historical information and those unobserved underlying factors. To this end, we propose a new event forecasting model called Contrastive Event Network (CENET), based on a novel training framework of historical contrastive learning. CENET learns both the historical and non-historical dependency to distinguish the most potential entities that can best match the given query. Simultaneously, it trains representations of queries to investigate whether the current moment depends more on historical or non-historical events by launching contrastive learning. The representations further help train a binary classifier whose output is a boolean mask to indicate related entities in the search space. During the inference process, CENET employs a mask-based strategy to generate the final results. We evaluate our proposed model on five benchmark graphs. The results demonstrate that CENET significantly outperforms all existing methods in most metrics, achieving at least 8.3% relative improvement of Hits@1 over previous state-of-the-art baselines on event-based datasets.
引用
收藏
页码:4765 / 4773
页数:9
相关论文
共 50 条
  • [31] Temporal inductive path neural network for temporal knowledge graph reasoning
    Dong, Hao
    Wang, Pengyang
    Xiao, Meng
    Ning, Zhiyuan
    Wang, Pengfei
    Zhou, Yuanchun
    [J]. ARTIFICIAL INTELLIGENCE, 2024, 329
  • [32] Graph Contrastive Learning for Tracking Dynamic Communities in Temporal Networks
    Ai, Yun
    Xie, Xianghua
    Ma, Xiaoke
    [J]. IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE, 2024,
  • [33] Dynamic Graph Contrastive Learning via Maximize Temporal Consistency
    Bao, Peng
    Li, Jianian
    Yan, Rong
    Liu, Zhongyi
    [J]. PATTERN RECOGNITION, 2024, 148
  • [34] MetaTKG plus plus : Learning evolving factor enhanced meta-knowledge for temporal knowledge graph reasoning
    Xia, Yuwei
    Zhang, Mengqi
    Liu, Qiang
    Wang, Liang
    Wu, Shu
    Zhang, Xiaoyu
    Wang, Liang
    [J]. PATTERN RECOGNITION, 2024, 155
  • [35] Disentangled Relational Graph Neural Network with Contrastive Learning for knowledge graph completion
    Yin, Hong
    Zhong, Jiang
    Li, Rongzhen
    Li, Xue
    [J]. KNOWLEDGE-BASED SYSTEMS, 2024, 295
  • [36] Multi-hop temporal knowledge graph reasoning with multi-agent reinforcement learning
    Bai, Luyi
    Chen, Mingzhuo
    Xiao, Qianwen
    [J]. APPLIED SOFT COMPUTING, 2024, 160
  • [37] Reasoning Like Human: Hierarchical Reinforcement Learning for Knowledge Graph Reasoning
    Wan, Guojia
    Pan, Shirui
    Gong, Chen
    Zhou, Chuan
    Haffari, Gholamreza
    [J]. PROCEEDINGS OF THE TWENTY-NINTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2020, : 1926 - 1932
  • [38] Multi-contrastive Learning Recommendation Combined with Knowledge Graph
    Chen, Fei
    Kang, Zihan
    Zhang, Chenxi
    Wu, Chunming
    [J]. 2023 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, IJCNN, 2023,
  • [39] A Knowledge Graph Recommendation Approach Incorporating Contrastive and Relationship Learning
    Shen, Xintao
    Zhang, Yulai
    [J]. IEEE ACCESS, 2023, 11 : 99628 - 99637
  • [40] Enhancing recommendations with contrastive learning from collaborative knowledge graph
    Ma, Yubin
    Zhang, Xuan
    Gao, Chen
    Tang, Yahui
    Li, Linyu
    Zhu, Rui
    Yin, Chunlin
    [J]. NEUROCOMPUTING, 2023, 523 : 103 - 115