Are Missing Links Predictable? An Inferential Benchmark for Knowledge Graph Completion
We present InferWiki, a Knowledge Graph Completion (KGC) dataset that improves upon existing benchmarks in inferential ability, assumptions, and patterns. First, each testing sample is predictable with supportive data in the training set. To ensure it, we propose to utilize rule-guided train/test generation, instead of conventional random split. Second, InferWiki initiates the evaluation following the open-world assumption and improves the inferential difficulty of the closed-world assumption, by providing manually annotated negative and unknown triples. Third, we include various inference patterns (e.g., reasoning path length and types) for comprehensive evaluation. In experiments, we curate two settings of InferWiki varying in sizes and structures, and apply the construction process on CoDEx as comparative datasets. The results and empirical analyses demonstrate the necessity and high-quality of InferWiki. Nevertheless, the performance gap among various inferential assumptions and patterns presents the difficulty and inspires future research direction. Our datasets can be found in https://github.com/TaoMiner/inferwiki
Code (1)
Tasks
Knowledge Graph CompletionSimilar Papers 제목 키워드 기반
HyperCausalLP: Causal Link Prediction using Hyper-Relational Knowledge Graph
Causal networks are often incomplete with missing causal links. This is due to various issues, such as missing observation data. Recent approaches to the issue of incomplete causal networks have used knowledge graph link…
Knowledge Graph CompletionLink PredictionPredictionConvolutional Complex Knowledge Graph Embeddings
In this paper, we study the problem of learning continuous vector representations of knowledge graphs for predicting missing links. We present a new approach called ConEx, which infers missing links by leveraging the com…
Knowledge Graph EmbeddingsKnowledge GraphsLink PredictionRevisiting Inferential Benchmarks for Knowledge Graph Completion
Knowledge Graph (KG) completion is the problem of extending an incomplete KG with missing facts. A key feature of Machine Learning approaches for KG completion is their ability to learn inference patterns, so that the pr…
Knowledge Graph CompletionOn the Estimation of Peer Effects for Sampled Networks
This paper deals with the estimation of exogeneous peer effects for partially observed networks under the new inferential paradigm of design identification, which characterizes the missing data challenge arising with sam…
ZeroKBC: A Comprehensive Benchmark for Zero-Shot Knowledge Base Completion
Knowledge base completion (KBC) aims to predict the missing links in knowledge graphs. Previous KBC tasks and approaches mainly focus on the setting where all test entities and relations have appeared in the training set…
Knowledge Base CompletionKnowledge Graphs