This paper addresses machine learning models that embed knowledge graph entities and relationships toward the goal of predicting unseen triples, which is an important task because most knowledge graphs are by nature incomplete. We posit that while offline link prediction accuracy using embeddings has been steadily improving on benchmark datasets, such embedding models have limited practical utility in real-world knowledge graph completion tasks because it is not clear when their predictions should be accepted or trusted. To this end, we propose to calibrate knowledge graph embedding models to output reliable confidence estimates for predicted triples. In crowdsourcing experiments, we demonstrate that calibrated confidence scores can make knowledge graph embeddings more useful to practitioners and data annotators in knowledge graph completion tasks. We also release two resources from our evaluation tasks: An enriched version of the FB15K benchmark and a new knowledge graph dataset extracted from Wikidata.

• T. Safavi, D. Koutra, and E. Meij, Improving the utility of knowledge graph embeddings with calibration, 2020.
  [Bibtex]

  @misc{ARXIV:2020:Safavi,
  Archiveprefix = {arXiv},
  Author = {Tara Safavi and Danai Koutra and Edgar Meij},
  Date-Added = {2020-06-03 06:34:40 +0100},
  Date-Modified = {2020-06-03 06:47:20 +0100},
  Eprint = {2004.01168},
  Primaryclass = {cs.AI},
  Title = {Improving the Utility of Knowledge Graph Embeddings with Calibration},
  Year = {2020}}