Tensor Decompositions for temporal knowledge base completion

• URL: http://arxiv.org/abs/2004.04926v1
• Date: Fri, 10 Apr 2020 07:09:30 GMT
• Title: Tensor Decompositions for temporal knowledge base completion
• Abstract summary: We introduce new regularization schemes and present an extension of ComplEx (Trouillon et al., 2016) that achieves state-of-the-art performance. We also propose a new dataset for knowledge base completion constructed from Wikidata, larger than previous benchmarks by an order of magnitude.
• Score: 18.09363207672722
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Most algorithms for representation learning and link prediction in relational data have been designed for static data. However, the data they are applied to usually evolves with time, such as friend graphs in social networks or user interactions with items in recommender systems. This is also the case for knowledge bases, which contain facts such as (US, has president, B. Obama, [2009-2017]) that are valid only at certain points in time. For the problem of link prediction under temporal constraints, i.e., answering queries such as (US, has president, ?, 2012), we propose a solution inspired by the canonical decomposition of tensors of order 4. We introduce new regularization schemes and present an extension of ComplEx (Trouillon et al., 2016) that achieves state-of-the-art performance. Additionally, we propose a new dataset for knowledge base completion constructed from Wikidata, larger than previous benchmarks by an order of magnitude, as a new reference for evaluating temporal and non-temporal link prediction methods.

Related papers

• Temporal Preference Optimization for Unsupervised Retrieval [11.583736130556611]
  We propose TPOUR (Temporal Preference Optimization for Unsupervised Retriever), which uses our novel training method Temporal Retrieval Preference Optimization (TRPO)<n>TPOUR generalizes to unseen time periods via in a learned time embedding, enabling continuous temporal alignment.<n>Compared to Qwen-Embedding-8B, despite being about 72.7x smaller, TPOUR Contriever improves average nDCG@5 by +4.04 (+12.15%) on explicit and +4.98 (+15.21%) on implicit queries.
  arXiv  Detail & Related papers  (2026-06-16T08:27:22Z)
• Temporal Knowledge Graph Hyperedge Forecasting: Exploring Entity-to-Category Link Prediction [0.2291770711277359]
  Temporal Knowledge Graphs have emerged as a powerful way of not only modeling static relationships between entities but also the dynamics of how relations evolve over time.<n>Most of the research in this field focuses on embedding-based methods, often leveraging convolutional neural net architectures.<n>In this paper, we explore an extension to an established rule-based framework, TLogic, that yields a high accuracy in combination with explainable predictions.
  arXiv  Detail & Related papers  (2025-10-28T09:47:38Z)
• Relational Conformal Prediction for Correlated Time Series [56.59852921638328]
  We propose a novel distribution-free approach based on conformal prediction framework and quantile regression. We fill this void by introducing a novel conformal prediction method based on graph deep learning operators. Our approach provides accurate coverage and archives state-of-the-art uncertainty quantification in relevant benchmarks.
  arXiv  Detail & Related papers  (2025-02-13T16:12:17Z)
• From Link Prediction to Forecasting: Information Loss in Batch-based Temporal Graph Learning [0.716879432974126]
  We show that the suitability of common batch-oriented evaluation depends on the datasets' characteristics. We reformulate dynamic link prediction as a link forecasting task that better accounts for temporal information present in the data.
  arXiv  Detail & Related papers  (2024-06-07T12:45:12Z)
• TEILP: Time Prediction over Knowledge Graphs via Logical Reasoning [14.480267340831542]
  We propose TEILP, a logical reasoning framework that naturally integrates temporal elements into knowledge graph predictions. We first convert TKGs into a temporal event knowledge graph (TEKG) which has a more explicit representation of time in term of nodes of the graph. Finally, we introduce conditional probability density functions, associated with the logical rules involving the query interval, using which we arrive at the time prediction.
  arXiv  Detail & Related papers  (2023-12-25T21:54:56Z)
• Temporal Smoothness Regularisers for Neural Link Predictors [8.975480841443272]
  We show that a simple method like TNTComplEx can produce significantly more accurate results than state-of-the-art methods. We also evaluate the impact of a wide range of temporal smoothing regularisers on two state-of-the-art temporal link prediction models.
  arXiv  Detail & Related papers  (2023-09-16T16:52:49Z)
• Temporal Graph Benchmark for Machine Learning on Temporal Graphs [54.52243310226456]
  Temporal Graph Benchmark (TGB) is a collection of challenging and diverse benchmark datasets. We benchmark each dataset and find that the performance of common models can vary drastically across datasets. TGB provides an automated machine learning pipeline for reproducible and accessible temporal graph research.
  arXiv  Detail & Related papers  (2023-07-03T13:58:20Z)
• NeuSTIP: A Novel Neuro-Symbolic Model for Link and Time Prediction in Temporal Knowledge Graphs [13.442923127130806]
  We propose a novel temporal neuro-symbolic model, NeuSTIP, that performs link prediction and time interval prediction in a temporal knowledge graph. NeuSTIP learns temporal rules in the presence of the Allen predicates that ensure the temporal consistency between neighboring predicates. Our empirical evaluation on two time interval based datasets suggests that our model outperforms state-of-the-art models for both link prediction and the time interval prediction task.
  arXiv  Detail & Related papers  (2023-05-15T13:46:34Z)
• HiSMatch: Historical Structure Matching based Temporal Knowledge Graph Reasoning [59.38797474903334]
  This paper proposes the textbfHistorical textbfStructure textbfMatching (textbfHiSMatch) model. It applies two structure encoders to capture the semantic information contained in the historical structures of the query and candidate entities. Experiments on six benchmark datasets demonstrate the significant improvement of the proposed HiSMatch model, with up to 5.6% performance improvement in MRR, compared to the state-of-the-art baselines.
  arXiv  Detail & Related papers  (2022-10-18T09:39:26Z)
• 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)
• A Benchmark for Generalizable and Interpretable Temporal Question Answering over Knowledge Bases [67.33560134350427]
  TempQA-WD is a benchmark dataset for temporal reasoning. It is based on Wikidata, which is the most frequently curated, openly available knowledge base.
  arXiv  Detail & Related papers  (2022-01-15T08:49:09Z)
• TLogic: Temporal Logical Rules for Explainable Link Forecasting on Temporal Knowledge Graphs [13.085620598065747]
  In temporal knowledge graphs, time information is integrated into the graph by equipping each edge with a timestamp or a time range. We introduce TLogic, an explainable framework that is based on temporal logical rules extracted via temporal random walks.
  arXiv  Detail & Related papers  (2021-12-15T10:46:35Z)
• A Dataset for Answering Time-Sensitive Questions [88.95075983560331]
  Time is an important dimension in our physical world. Lots of facts can evolve with respect to time. It is important to consider the time dimension and empower the existing QA models to reason over time. The existing QA datasets contain rather few time-sensitive questions, hence not suitable for diagnosing or benchmarking the model's temporal reasoning capability.
  arXiv  Detail & Related papers  (2021-08-13T16:42:25Z)
• Are Missing Links Predictable? An Inferential Benchmark for Knowledge Graph Completion [79.07695173192472]
  InferWiki improves upon existing benchmarks in inferential ability, assumptions, and patterns. Each testing sample is predictable with supportive data in the training set. In experiments, we curate two settings of InferWiki varying in sizes and structures, and apply the construction process on CoDEx as comparative datasets.
  arXiv  Detail & Related papers  (2021-08-03T09:51:15Z)
• Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks [0.0]
  We present Wiki-CS, a novel dataset derived from Wikipedia for benchmarking Graph Neural Networks. The dataset consists of nodes corresponding to Computer Science articles, with edges based on hyperlinks and 10 classes representing different branches of the field. We use the dataset to evaluate semi-supervised node classification and single-relation link prediction models.
  arXiv  Detail & Related papers  (2020-07-06T17:25:47Z)
• Predicting Temporal Sets with Deep Neural Networks [50.53727580527024]
  We propose an integrated solution based on the deep neural networks for temporal sets prediction. A unique perspective is to learn element relationship by constructing set-level co-occurrence graph. We design an attention-based module to adaptively learn the temporal dependency of elements and sets.
  arXiv  Detail & Related papers  (2020-06-20T03:29:02Z)

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.