Temporal Knowledge Graph Hyperedge Forecasting: Exploring Entity-to-Category Link Prediction

• URL: http://arxiv.org/abs/2510.24240v1
• Date: Tue, 28 Oct 2025 09:47:38 GMT
• Title: Temporal Knowledge Graph Hyperedge Forecasting: Exploring Entity-to-Category Link Prediction
• Authors: Edward Markai, Sina Molavipour,
• Abstract summary: 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.
• Score: 0.2291770711277359
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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. As these informational structures can be used to store information from a real-world setting, such as a news flow, predicting future graph components to a certain extent equates predicting real-world events. Most of the research in this field focuses on embedding-based methods, often leveraging convolutional neural net architectures. These solutions act as black boxes, limiting insight. In this paper, we explore an extension to an established rule-based framework, TLogic, that yields a high accuracy in combination with explainable predictions. This offers transparency and allows the end-user to critically evaluate the rules applied at the end of the prediction stage. The new rule format incorporates entity category as a key component with the purpose of limiting rule application only to relevant entities. When categories are unknown for building the graph, we propose a data-driven method to generate them with an LLM-based approach. Additionally, we investigate the choice of aggregation method for scores of retrieved entities when performing category prediction.

Related papers

• Context Pooling: Query-specific Graph Pooling for Generic Inductive Link Prediction in Knowledge Graphs [55.918039693545616]
  We introduce a novel method, named Context Pooling, to enhance GNN-based models' efficacy for link predictions in Knowledge Graphs.<n>Our method is generic and assessed by being applied to two state-of-the-art (SOTA) models on three public transductive and inductive datasets.
  arXiv  Detail & Related papers  (2025-07-10T09:54:37Z)
• 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)
• Enhancing Scene Graph Generation with Hierarchical Relationships and Commonsense Knowledge [7.28830964611216]
  This work introduces an enhanced approach to generating scene graphs by both a relationship hierarchy and commonsense knowledge.<n>We implement a robust commonsense validation pipeline that harnesses foundation models to critique the results from the scene graph prediction system.<n>Experiments on Visual Genome and OpenImage V6 datasets demonstrate that the proposed modules can be seamlessly integrated as plug-and-play enhancements to existing scene graph generation algorithms.
  arXiv  Detail & Related papers  (2023-11-21T06:03:20Z)
• 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)
• SMiLE: Schema-augmented Multi-level Contrastive Learning for Knowledge Graph Link Prediction [28.87290783250351]
  Link prediction is the task of inferring missing links between entities in knowledge graphs. We propose a novel Multi-level contrastive LEarning framework (SMiLE) to conduct knowledge graph link prediction.
  arXiv  Detail & Related papers  (2022-10-10T17:40:19Z)
• Reasoning Through Memorization: Nearest Neighbor Knowledge Graph Embeddings [29.94706167233985]
  kNN-KGE is a new knowledge graph embedding approach with pre-trained language models. We compute the nearest neighbors based on the distance in the entity embedding space from the knowledge store.
  arXiv  Detail & Related papers  (2022-01-14T17:35:16Z)
• 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)
• Neural Production Systems [90.75211413357577]
  Visual environments are structured, consisting of distinct objects or entities. To partition images into entities, deep-learning researchers have proposed structural inductive biases. We take inspiration from cognitive science and resurrect a classic approach, which consists of a set of rule templates. This architecture achieves a flexible, dynamic flow of control and serves to factorize entity-specific and rule-based information.
  arXiv  Detail & Related papers  (2021-03-02T18:53:20Z)
• 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)
• Connecting the Dots: Multivariate Time Series Forecasting with Graph Neural Networks [91.65637773358347]
  We propose a general graph neural network framework designed specifically for multivariate time series data. Our approach automatically extracts the uni-directed relations among variables through a graph learning module. Our proposed model outperforms the state-of-the-art baseline methods on 3 of 4 benchmark datasets.
  arXiv  Detail & Related papers  (2020-05-24T04:02:18Z)
• Relational Message Passing for Knowledge Graph Completion [78.47976646383222]
  We propose a relational message passing method for knowledge graph completion. It passes relational messages among edges iteratively to aggregate neighborhood information. Results show our method outperforms stateof-the-art knowledge completion methods by a large margin.
  arXiv  Detail & Related papers  (2020-02-17T03:33:41Z)

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.