ACTC: Active Threshold Calibration for Cold-Start Knowledge Graph Completion

05/10/2023
by   Anastasiia Sedova, et al.
0

Self-supervised knowledge-graph completion (KGC) relies on estimating a scoring model over (entity, relation, entity)-tuples, for example, by embedding an initial knowledge graph. Prediction quality can be improved by calibrating the scoring model, typically by adjusting the prediction thresholds using manually annotated examples. In this paper, we attempt for the first time cold-start calibration for KGC, where no annotated examples exist initially for calibration, and only a limited number of tuples can be selected for annotation. Our new method ACTC finds good per-relation thresholds efficiently based on a limited set of annotated tuples. Additionally to a few annotated tuples, ACTC also leverages unlabeled tuples by estimating their correctness with Logistic Regression or Gaussian Process classifiers. We also experiment with different methods for selecting candidate tuples for annotation: density-based and random selection. Experiments with five scoring models and an oracle annotator show an improvement of 7 challenging setting with an annotation budget of only 10 tuples, and an average improvement of 4

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/13/2016

Joint Representation Learning of Text and Knowledge for Knowledge Graph Completion

Joint representation learning of text and knowledge within a unified sem...
research
10/30/2018

DSKG: A Deep Sequential Model for Knowledge Graph Completion

Knowledge graph (KG) completion aims to fill the missing facts in a KG, ...
research
04/16/2021

Improving Hyper-Relational Knowledge Graph Completion

Different from traditional knowledge graphs (KGs) where facts are repres...
research
12/20/2019

Probability Calibration for Knowledge Graph Embedding Models

Knowledge graph embedding research has overlooked the problem of probabi...
research
07/01/2021

AutoSF+: Towards Automatic Scoring Function Design for Knowledge Graph Embedding

Scoring functions, which measure the plausibility of triples, have becom...
research
10/25/2019

Using Pairwise Occurrence Information to Improve Knowledge Graph Completion on Large-Scale Datasets

Bilinear models such as DistMult and ComplEx are effective methods for k...
research
06/11/2021

Robust Knowledge Graph Completion with Stacked Convolutions and a Student Re-Ranking Network

Knowledge Graph (KG) completion research usually focuses on densely conn...

Please sign up or login with your details

Forgot password? Click here to reset