The KEEN Universe: An Ecosystem for Knowledge Graph Embeddings with a Focus on Reproducibility and Transferability
Mehdi Ali, Hajira Jabeen, Charles Tapley Hoyt, and Jens Lehman

TL;DR
The KEEN Universe ecosystem provides tools and resources for knowledge graph embeddings, emphasizing reproducibility and transferability to enhance research and application in the semantic web and related fields.
Contribution
It introduces the KEEN Universe, including Python packages and a model zoo, to improve reproducibility and transferability of knowledge graph embedding models.
Findings
Enhanced reproducibility through standardized tools
Facilitated transferability across research domains
Community sharing via KEEN Model Zoo
Abstract
There is an emerging trend of embedding knowledge graphs (KGs) in continuous vector spaces in order to use those for machine learning tasks. Recently, many knowledge graph embedding (KGE) models have been proposed that learn low dimensional representations while trying to maintain the structural properties of the KGs such as the similarity of nodes depending on their edges to other nodes. KGEs can be used to address tasks within KGs such as the prediction of novel links and the disambiguation of entities. They can also be used for downstream tasks like question answering and fact-checking. Overall, these tasks are relevant for the semantic web community. Despite their popularity, the reproducibility of KGE experiments and the transferability of proposed KGE models to research fields outside the machine learning community can be a major challenge. Therefore, we present the KEEN Universe,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Graph Theory and Algorithms · Data Quality and Management
