Updated available thesis.

pages/theses/ESTHEREmbeddings.mdx

@@ -0,0 +1,18 @@
+---
+date: '2024-02-09'
+title: 'An Embedding Space for path-based Fact Checking'
+type: 'Master'
+supervisor: dice:MichaelRoeder
+contact: dice:MichaelRoeder
+---
+
+Validating facts before integrating them into a knowledge graph and running complex machine learning algorithms on it is an important task to ensure that the results of the used algorithms remain reliable. To this end, various Fact Checking algorithms have been created. Some of these algorithms make use of paths within a knowledge graph, as depicted below:
+
+<Image filename="Facts_Obama_complete.png" />
+
+One of these path-based steps is to identify paths that support or refute a given fact. Unfortunately, this search is quite expensive for longer paths. Hence, Da Silva et al. introduced ESTHER, an approach that searches within an embedding space for these paths. The goal of this thesis is to go beyond this idea and implement a knowledge graph embedding algorithm that is specifically designed for fact checking. The designed algorithm should be implemented within the DICE embeddings framework.
+
+### Links
+* ESTHER [publication](https://papers.dice-research.org/2021/ISWC2021_Esther/ESTHER_public.pdf) and [code](https://github.com/dice-group/esther)
+* [Embeddings framework](https://github.com/dice-group/dice-embeddings)
+

pages/theses/sameAsService.mdx

@@ -0,0 +1,17 @@
+---
+date: '2024-02-09'
+title: 'SameAs Retrieval Service'
+type: 'Bachelor'
+supervisor: dice:MichaelRoeder
+contact: dice:MichaelRoeder
+---
+
+When working with knowledge graphs, several IRIs can point to the same real-world entity. While it is a simple insight, it still creates a lot of challenges in today's semantic web based applications. A solution can be to gather owl:sameAs links to identify IRIs that point to the same real-world entity, e.g., as [GERBIL](https://www.semantic-web-journal.net/system/files/swj1671.pdf) does it (see "URI set retrieval" in 4.2.2). However, this can lead to a lot of work that has to be done locally by a single machine. What we propose instead is to develop a web service that takes a given IRI and provides a set of IRIs that point all to the same real-world entity as the given IRI.
+
+There has been works before that went into a similar direction. [SameAs.cc](https://sameas.cc/) was an effort to provide such a service. However, it comes with several drawbacks:
+1. It provides sets of IRIs from which it is known that they are faulty (i.e., IRIs with different meanings are within the same set).
+2. It relies on data from 2018.
+3. It does not provide provenance for the provided set.
+
+The goal of this thesis is to target all these drawbacks and provide a service that can be used by other knowledge-graph-based applications, easily.
+

pages/theses/sameAsServiceMaster.mdx

@@ -0,0 +1,17 @@
+---
+date: '2024-02-09'
+title: 'SameAs Retrieval Service'
+type: 'Master'
+supervisor: dice:MichaelRoeder
+contact: dice:MichaelRoeder
+---
+
+When working with knowledge graphs, several IRIs can point to the same real-world entity. While it is a simple insight, it still creates a lot of challenges in today's semantic web based applications. A solution can be to gather owl:sameAs links to identify IRIs that point to the same real-world entity, e.g., as [GERBIL](https://www.semantic-web-journal.net/system/files/swj1671.pdf) does it (see "URI set retrieval" in 4.2.2). However, this can lead to a lot of work that has to be done locally by a single machine. What we propose instead is to develop a web service that takes a given IRI and provides a set of IRIs that point all to the same real-world entity as the given IRI.
+
+There has been works before that went into a similar direction. [SameAs.cc](https://sameas.cc/) was an effort to provide such a service. However, it comes with several drawbacks:
+1. It provides sets of IRIs from which it is known that they are faulty (i.e., IRIs with different meanings are within the same set).
+2. It relies on data from 2018.
+3. It does not provide provenance for the provided set.
+
+The goal of this thesis is to target all these drawbacks and provide a service that can be used by other knowledge-graph-based applications, easily.
+