Assessing, Creating and Using Knowledge Graph Restrictions

Chapter structure of my PhD thesis
PhD dissertation, Ghent University, Belgium

More and more data is created, but meaningfully answer questions with this data is not straightforward because we need a shared understanding of what the different data means and how it relates. Knowledge Graphs with concepts and relationships offer a flexible way to represent information: “Sven (thing) writes (relationship) dissertation(thing)” and “Sven (thing) is a (relationship) Person (thing)”. The technological basis of these graphs can be the web, where components of the graph are web addresses, thus humans and machines can look up components of the graph.

However, one has to restrict possible connections in the graph such that also a computer can make sense out of it. Otherwise a “dissertation (thing) can breathe (relationship) air (thing)”, which does not make any sense and leads to wrong insights of data. Restrictions can either be expressed using axioms to provide formal meaning or as local constraints to validate data.

This doctoral thesis tackles the support of users when assessing, creating and using Knowledge Graph restrictions. More concretely, in this dissertation the FAIR Montolo statistics are contributed, supporting users in assessing existing Knowledge Graphs based on used restrictions. The two visual notations ShapeUML and ShapeVOWL are presented and evaluated: they represent all constraint types of the Shapes Constraint Language (SHACL) and thus advance the state of the art. Finally, the use of restrictions to represent formal meaning and to assess data quality is demonstrated for a social media archiving use case in the BESOCIAL project of the Royal Library of Belgium (KBR).

Sven Lieber
Sven Lieber
data manager

Meine Forschungsinteressen umfassen FAIR und Linked Data.