no code implementations • WS 2019 • Saatviga Sudhahar, Ian Roberts, Andrea Pierleoni
We demonstrate that our method is able to effectively rank a list of known paths between a pair of entities and also come up with plausible paths that are not present in the knowledge graph.