Open Theses

This is just a collection of ideas that have already been formulated. We always have interesting ideas which have not been written down yet. If the list is empty, you don't find any of the ideas interesting, or you have your own idea, just contact us by email.

 

Efficient Computation of Detailed Source Descriptions for Knowledge Graphs

Computation of semantic source descriptions for federations of knowledge graphs in an efficient way.

Type Master's Thesis
Supervisor Philipp D. Rohde
Maria-Esther Vidal

 

Efficient Validation of RDF Data using SHACL

Efficiently validating integrity constraints over RDF data using SHACL and SPARQL.

Type Master's Thesis
Supervisor Philipp D. Rohde
Maria-Esther Vidal

 

Efficiently Validating Property Graphs

Efficiently validating integrity constraints over property graphs.

Type Master's Thesis
Supervisor Philipp D. Rohde
Maria-Esther Vidal

 

Negative Sampling using Integrity Constraints

Exploiting results from integrity constraint validation in negative sampling.

Type Master's Thesis
Supervisor Philipp D. Rohde
Emetis Niazmand
Maria-Esther Vidal

 

Feedback