Vortrag Kolloquium Angewandte Informatik Jörn Hees

Aus Aifbportal
Wechseln zu:Navigation, Suche

Learning Graph Patterns from Linked Data - An Adaptive Explainable Embedding

Kolloquium Angewandte Informatik

In recent years, we have seen a lot of progress in the field of Artificial Intelligence, especially in the area of Deep Learning and end-to-end learning. However, the vast majority of these new ap-proaches do not make use of available knowledge in form of Linked Data. One of the reasons for this is that it is still a very challenging task to incorporate such knowledge: At the moment knowledge experts have to manually select knowledge sources and extract useful “knowledge features” up-front.

In this talk, a machine learning algorithm is presented that was originally designed to simulate a part of human thinking itself, namely associating: the process of navigating from one thought to the next. The presented approach is an evolutionary algorithm which can learn graph patterns (SPARQL queries) from a given SPARQL endpoint based on a given list of training source-target entity pairs. After training, given a new source node, the algorithm can predict target nodes analo-gously to the training list.

It will be presented, how the Graph Pattern Learner operates in an end-to-end learning fashion and extracts features in form of graph patterns without the need for human intervention from huge, noisy, real world knowledge graphs. Further, it will be shown, how the learned graph patterns form a feature space (embedding) adapted to the given list of examples, and being SPARQL queries, can be explained and executed to generate target candidates. The talk will conclude with current research areas arising from these properties.

(Jörn Hees)

Start: 08. Februar 2019 um 14:00
Ende: 08. Februar 2019 um 15:30

Im Gebäude 05.20, Raum: 3A-11.2

Veranstaltung vormerken: (iCal)

Veranstalter: Forschungsgruppe(n) Information Service Engineering
Information: Media:Hees 08-02-2019.pdf