Embedding Mapping Approaches for Tensor Factorization and Knowledge Graph Modelling

Conference paper

DOI: 10.1007/978-3-319-34129-3_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9678)
Cite this paper as:
Yang Y., Esteban C., Tresp V. (2016) Embedding Mapping Approaches for Tensor Factorization and Knowledge Graph Modelling. In: Sack H., Blomqvist E., d'Aquin M., Ghidini C., Ponzetto S., Lange C. (eds) The Semantic Web. Latest Advances and New Domains. ESWC 2016. Lecture Notes in Computer Science, vol 9678. Springer, Cham


Latent embedding models are the basis of state-of-the art statistical solutions for modelling Knowledge Graphs and Recommender Systems. However, to be able to perform predictions for new entities and relation types, such models have to be retrained completely to derive the new latent embeddings. This could be a potential limitation when fast predictions for new entities and relation types are required. In this paper we propose approaches that can map new entities and new relation types into the existing latent embedding space without the need for retraining. Our proposed models are based on the observable —even incomplete— features of a new entity, e.g. a subset of observed links to other known entities. We show that these mapping approaches are efficient and are applicable to a wide variety of existing factorization models, including nonlinear models. We report performance results on multiple real-world datasets and evaluate the performances from different aspects.

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Yinchong Yang
    • 2
  • Cristóbal Esteban
    • 1
    • 2
  • Volker Tresp
    • 1
    • 2
  1. 1.Siemens AG, Corporate TechnologyMunichGermany
  2. 2.Ludwig-Maximilians-Universität MünchenMunichGermany

Personalised recommendations