Affiliation:
1. Fraunhofer IAIS, Smart Data Analytics Group, University of Bonn
2. Ludwig-Maximilians-Universität München
3. Mila, McGill University
4. IBM Research
5. Siemens, Ludwig-Maximilians-Universität München
Abstract
For many years, link prediction on knowledge. graphs has been a purely transductive task, not allowing for reasoning on unseen entities.
Recently, increasing efforts are put into exploring semi- and fully inductive scenarios, enabling inference over unseen and emerging entities.
Still, all these approaches only consider triple-based KGs, whereas their richer counterparts, hyper-relational KGs (e.g., Wikidata), have not yet been properly studied.
In this work, we classify different inductive settings and study the benefits of employing hyper-relational KGs on a wide range of semi- and fully inductive link prediction tasks powered by recent advancements in graph neural networks.
Our experiments on a novel set of benchmarks show that qualifiers over typed edges can lead to performance improvements of 6% of absolute gains (for the Hits@10 metric) compared to triple-only baselines.
Our code is available at https://github.com/mali-git/hyper_relational_ilp.
Publisher
International Joint Conferences on Artificial Intelligence Organization
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献