Temporal Knowledge Graph Reasoning with Historical Contrastive Learning

• URL: http://arxiv.org/abs/2211.10904v1
• Date: Sun, 20 Nov 2022 08:32:59 GMT
• Title: Temporal Knowledge Graph Reasoning with Historical Contrastive Learning
• Authors: Yi Xu, Junjie Ou, Hui Xu, Luoyi Fu
• Abstract summary: We propose a new event forecasting model called Contrastive Event Network (CENET) CENET learns both the historical and non-historical dependency to distinguish the most potential entities that can best match the given query. During the inference process, CENET employs a mask-based strategy to generate the final results.
• Score: 24.492458924487863
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: 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.

Related papers

• DPCL-Diff: The Temporal Knowledge Graph Reasoning based on Graph Node Diffusion Model with Dual-Domain Periodic Contrastive Learning [3.645855411897217]
  We propose a graph node diffusion model with dual-domain periodic contrastive learning (DPCL-Diff) GNDiff introduces noise into sparsely related events to simulate new events, generating high-quality data that better conforms to the actual distribution. DPCL-Diff maps periodic and non-periodic event entities to Poincar'e and Euclidean spaces, leveraging their characteristics to distinguish similar periodic events effectively.
  arXiv  Detail & Related papers  (2024-11-03T08:30:29Z)
• Historically Relevant Event Structuring for Temporal Knowledge Graph Reasoning [5.510391547468202]
  Temporal Knowledge Graph (TKG) reasoning focuses on predicting events through historical information within snapshots distributed on a timeline. We propose an innovative TKG reasoning approach towards textbfHistorically textbfRelevant textbfEvents textbfStructuring ($mathsfHisRES$)
  arXiv  Detail & Related papers  (2024-05-17T08:33:43Z)
• HIP Network: Historical Information Passing Network for Extrapolation Reasoning on Temporal Knowledge Graph [14.832067253514213]
  We propose the Historical Information Passing (HIP) network to predict future events. Our method considers the updating of relation representations and adopts three scoring functions corresponding to the above dimensions. Experimental results on five benchmark datasets show the superiority of HIP network.
  arXiv  Detail & Related papers  (2024-02-19T11:50:30Z)
• Exploring the Limits of Historical Information for Temporal Knowledge Graph Extrapolation [59.417443739208146]
  We propose a new event forecasting model 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. We evaluate our proposed model on five benchmark graphs.
  arXiv  Detail & Related papers  (2023-08-29T03:26:38Z)
• Logic and Commonsense-Guided Temporal Knowledge Graph Completion [9.868206060374991]
  A temporal knowledge graph (TKG) stores the events derived from the data involving time. We propose a Logic and Commonsense-Guided Embedding model (LCGE) to jointly learn the time-sensitive representation involving timeliness and causality of events.
  arXiv  Detail & Related papers  (2022-11-30T10:06:55Z)
• CEP3: Community Event Prediction with Neural Point Process on Graph [59.434777403325604]
  We propose a novel model combining Graph Neural Networks and Marked Temporal Point Process (MTPP) Our experiments demonstrate the superior performance of our model in terms of both model accuracy and training efficiency.
  arXiv  Detail & Related papers  (2022-05-21T15:30:25Z)
• A Closer Look at Debiased Temporal Sentence Grounding in Videos: Dataset, Metric, and Approach [53.727460222955266]
  Temporal Sentence Grounding in Videos (TSGV) aims to ground a natural language sentence in an untrimmed video. Recent studies have found that current benchmark datasets may have obvious moment annotation biases. We introduce a new evaluation metric "dR@n,IoU@m" that discounts the basic recall scores to alleviate the inflating evaluation caused by biased datasets.
  arXiv  Detail & Related papers  (2022-03-10T08:58:18Z)
• Networked Time Series Prediction with Incomplete Data [59.45358694862176]
  We propose NETS-ImpGAN, a novel deep learning framework that can be trained on incomplete data with missing values in both history and future. We conduct extensive experiments on three real-world datasets under different missing patterns and missing rates.
  arXiv  Detail & Related papers  (2021-10-05T18:20:42Z)
• Omni-supervised Facial Expression Recognition via Distilled Data [120.11782405714234]
  We propose omni-supervised learning to exploit reliable samples in a large amount of unlabeled data for network training. We experimentally verify that the new dataset can significantly improve the ability of the learned FER model. To tackle this, we propose to apply a dataset distillation strategy to compress the created dataset into several informative class-wise images.
  arXiv  Detail & Related papers  (2020-05-18T09:36:51Z)
• A Multi-Channel Neural Graphical Event Model with Negative Evidence [76.51278722190607]
  Event datasets are sequences of events of various types occurring irregularly over the time-line. We propose a non-parametric deep neural network approach in order to estimate the underlying intensity functions.
  arXiv  Detail & Related papers  (2020-02-21T23:10:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.