Abstract

We focus on the problem of predicting missing links in large Knowledge Graphs (KGs), so to discover new facts. Over the last years, latent factor models for link prediction have been receiving an increasing interest: they achieve state-of-the-art accuracy in link prediction tasks, while scaling to very large KGs. However, KGs are often endowed with additional schema knowledge, describing entity classes, their sub-class relationships, and the domain and range of each predicate: the schema is actually not used by latent factor models proposed in the literature. In this work, we propose an unified method for leveraging additional schema knowledge in latent factor models, with the aim of learning more accurate link prediction models. Our experimental evaluations show the effectiveness of the proposed method on several KGs.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.