31 citations · 34 across the 3 of their papers we have counts for
4 papers
Reinforced Anytime Bottom Up Rule Learning for Knowledge Graph Completion
Christian Meilicke, Melisachew Wudage Chekol, Manuel Fink +1
Most of todays work on knowledge graph completion is concerned with sub-symbolic approaches that focus on the concept of embedding a given graph in a low dimensional vector space.…
A Variational-Sequential Graph Autoencoder for Neural Architecture Performance Prediction
David Friede, Jovita Lukasik, Heiner Stuckenschmidt +1
In computer vision research, the process of automating architecture engineering, Neural Architecture Search (NAS), has gained substantial interest. In the past, NAS was hardly acce…
Towards Log-Linear Logics with Concrete Domains
Melisachew Wudage Chekol, Jakob Huber, Heiner Stuckenschmidt
We present (M denotes Markov logic networks) an extension of the log-linear description logics -LL with concrete domains, nominals, and inst…
Evaluating Ontology Matching Systems on Large, Multilingual and Real-world Test Cases
Christian Meilicke, Ondrej Sváb-Zamazal, Cássia Trojahn +4
In the field of ontology matching, the most systematic evaluation of matching systems is established by the Ontology Alignment Evaluation Initiative (OAEI), which is an annual camp…