Thema4589: Unterschied zwischen den Versionen

Aus Aifbportal
Wechseln zu:Navigation, Suche
(Die Seite wurde neu angelegt: „{{Abschlussarbeit |Titel=Exploring Graph traversal algorithms for Knowledge Graphs |Abschlussarbeitstyp=Bachelor |Betreuer=Harald Sack; Russa Biswas |Partner=F…“)
Zeile 5: Zeile 5:
|Partner=FIZ Karlsruhe
|Partner=FIZ Karlsruhe
|Forschungsgruppe=Information Service Engineering
|Forschungsgruppe=Information Service Engineering
|Ausschreibung=Bachelor Thesis - Graph Traversal.pdf
|Ausschreibung=Bachelor Thesis - Graph Traversal.pdf

Version vom 22. April 2020, 11:52 Uhr

Exploring Graph traversal algorithms for Knowledge Graphs

Informationen zur Arbeit

Abschlussarbeitstyp: Bachelor
Betreuer: Harald SackRussa Biswas
Forschungsgruppe: Information Service Engineering
Partner: FIZ Karlsruhe
Archivierungsnummer: 4589
Abschlussarbeitsstatus: Vergeben
Beginn: 01. Mai 2020
Abgabe: unbekannt

Weitere Informationen

The problem of graph traversal in graph theory refers to the mechanism of traversing every edge and vertex in a graph in a systematic way. Graph walk is one of the ways of graph traversal. A walk is a sequence of vertices and edges of a graph, with repeated nodes and edges. A path is a walk without repeated vertices. This is a well studied problem in the field of Graph Theory [1]. This thesis focuses on exploring different graph traversal algorithms in the pretext of Knowledge Graphs (KG). A KG is a directed graph which consists of a set of entities denoting real world objects and relations between them [2]. The entities are the nodes in the graph and the edge between two nodes represents the relation between these entities. Therefore, every edge in a KG has a label. DBpedia, Wikidata, Freebase, YAGO are some popular open KGs. In this work, the focus would be on exploring the graph traversal algorithms on DBpedia and compare their efficiency w.r.t computational (space and time) complexity considering the fact that KGs contain millions of facts. Therefore, the goal would be finding the existing most efficient graph traversal algorithms which are applicable to find paths between two nodes in KGs by comparison.

[1] [2]

Ausschreibung: Download (pdf)