Negative Sampling using Integrity Constraints

The Resource Description Framework (RDF) is the W3C standard for publishing and exchanging data on the Web. An RDF graph is also called a Knowledge Graph. Embeddings are a low-dimensional space into which high-dimensional vectors can be translated. The goal of this work is to use integrity constraints over the Knowledge Graph to create the negative samples.

Voraussetzungen

  • Immatrikulation an einer deutschen Universität
  • Gute Englischkenntnisse in Schrift und Wort
  • Gute Programmierkenntnisse in Python

Hilfreiche Lehrveranstaltungen

  • Knowledge Engineering und Semantic Web
  • Datenstrukturen und Algorithmen
  • Machine Learning for Graphs
  • (Statistical) Natural Language Processing

Abgedeckte Themen

  • Knowledge Graphs
  • Embeddings
Feedback