PaTeCon: A Pattern-Based Temporal Constraint Mining Method for Conflict Detection on Knowledge Graphs

• URL: http://arxiv.org/abs/2304.09015v3
• Date: Fri, 12 May 2023 14:48:00 GMT
• Title: PaTeCon: A Pattern-Based Temporal Constraint Mining Method for Conflict Detection on Knowledge Graphs
• Authors: Jianhao Chen, Junyang Ren, Wentao Ding, Yuzhong Qu
• Abstract summary: We propose a pattern-based temporal constraint mining method, PaTeCon. We evaluate PaTeCon on two large-scale datasets based on Wikidata and Freebase respectively.
• Score: 17.688897597288992
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Temporal facts, the facts for characterizing events that hold in specific time periods, are attracting rising attention in the knowledge graph (KG) research communities. In terms of quality management, the introduction of time restrictions brings new challenges to maintaining the temporal consistency of KGs and detecting potential temporal conflicts. Previous studies rely on manually enumerated temporal constraints to detect conflicts, which are labor-intensive and may have granularity issues. We start from the common pattern of temporal facts and constraints and propose a pattern-based temporal constraint mining method, PaTeCon. PaTeCon uses automatically determined graph patterns and their relevant statistical information over the given KG instead of human experts to generate time constraints. Specifically, PaTeCon dynamically attaches class restriction to candidate constraints according to their measuring scores.We evaluate PaTeCon on two large-scale datasets based on Wikidata and Freebase respectively. The experimental results show that pattern-based automatic constraint mining is powerful in generating valuable temporal constraints.

Related papers

• Learning Granularity Representation for Temporal Knowledge Graph Completion [2.689675451882683]
  Temporal Knowledge Graphs (TKGs) incorporate temporal information to reflect the dynamic structural knowledge and evolutionary patterns of real-world facts. This paper proposes textbfLearning textbfGranularity textbfRepresentation (termed $mathsfLGRe$) for TKG completion. It comprises two main components: Granularity Learning (GRL) and Adaptive Granularity Balancing (AGB)
  arXiv  Detail & Related papers  (2024-08-27T08:19:34Z)
• Temporally Grounding Instructional Diagrams in Unconstrained Videos [51.85805768507356]
  We study the challenging problem of simultaneously localizing a sequence of queries in instructional diagrams in a video. Most existing methods focus on grounding one query at a time, ignoring the inherent structures among queries. We propose composite queries constructed by exhaustively pairing up the visual content features of the step diagrams. We demonstrate the effectiveness of our approach on the IAW dataset for grounding step diagrams and the YouCook2 benchmark for grounding natural language queries.
  arXiv  Detail & Related papers  (2024-07-16T05:44:30Z)
• On the Identification of Temporally Causal Representation with Instantaneous Dependence [50.14432597910128]
  Temporally causal representation learning aims to identify the latent causal process from time series observations. Most methods require the assumption that the latent causal processes do not have instantaneous relations. We propose an textbfIDentification framework for instantanetextbfOus textbfLatent dynamics.
  arXiv  Detail & Related papers  (2024-05-24T08:08:05Z)
• 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)
• Conflict Detection for Temporal Knowledge Graphs:A Fast Constraint Mining Algorithm and New Benchmarks [21.152721572830373]
  We propose a pattern-based temporal constraint mining method, PaTeCon. We show how this method can be optimized to achieve significant speed improvement. We also annotate Wikidata and Freebase to build two new benchmarks for conflict detection.
  arXiv  Detail & Related papers  (2023-12-18T09:35:43Z)
• Learning Multi-graph Structure for Temporal Knowledge Graph Reasoning [3.3571415078869955]
  This paper proposes an innovative reasoning approach that focuses on Learning Multi-graph Structure (LMS) LMS incorporates an adaptive gate for merging entity representations both along and across timestamps effectively. It also integrates timestamp semantics into graph attention calculations and time-aware decoders.
  arXiv  Detail & Related papers  (2023-12-04T08:23:09Z)
• 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)
• Generic Temporal Reasoning with Differential Analysis and Explanation [61.96034987217583]
  We introduce a novel task named TODAY that bridges the gap with temporal differential analysis. TODAY evaluates whether systems can correctly understand the effect of incremental changes. We show that TODAY's supervision style and explanation annotations can be used in joint learning.
  arXiv  Detail & Related papers  (2022-12-20T17:40:03Z)
• Spatio-temporal predictive tasks for abnormal event detection in videos [60.02503434201552]
  We propose new constrained pretext tasks to learn object level normality patterns. Our approach consists in learning a mapping between down-scaled visual queries and their corresponding normal appearance and motion characteristics. Experiments on several benchmark datasets demonstrate the effectiveness of our approach to localize and track anomalies.
  arXiv  Detail & Related papers  (2022-10-27T19:45:12Z)
• Semantic Framework based Query Generation for Temporal Question Answering over Knowledge Graphs [19.851986862305623]
  We propose a temporal question answering method, SF-TQA, which generates query graphs by exploring the relevant facts of mentioned entities. Our evaluations show that SF-TQA significantly outperforms existing methods on two benchmarks over different knowledge graphs.
  arXiv  Detail & Related papers  (2022-10-10T08:40:28Z)
• Exploring the Limits of Few-Shot Link Prediction in Knowledge Graphs [49.6661602019124]
  We study a spectrum of models derived by generalizing the current state of the art for few-shot link prediction. We find that a simple zero-shot baseline - which ignores any relation-specific information - achieves surprisingly strong performance. Experiments on carefully crafted synthetic datasets show that having only a few examples of a relation fundamentally limits models from using fine-grained structural information.
  arXiv  Detail & Related papers  (2021-02-05T21:04:31Z)

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.