On Training Knowledge Graph Embedding Models
Sameh K. Mohamed, Emir Muñoz, Vít Nováček · Information · 2021
Knowledge graph embedding (KGE) models have become popular means for making discoveries in knowledge graphs (e.g., RDF graphs) in an efficient and scalable manner. The key to success of these models is their ability to learn low-rank vector representations for knowledge graph entities and relations. Despite the rapid development of KGE models, state-of-the-art approaches have mostly focused on new ways to represent embeddings interaction functions (i.e., scoring functions). In this paper, we argue that the choice of other training components such as the loss function, hyperparameters and negative sampling strategies can also have substantial impact on the model efficiency. This area has been rather neglected by previous works so far and our contribution is towards closing this gap by a thorough analysis of possible choices of training loss functions, hyperparameters and negative sampling techniques. We finally investigate the effects of specific choices on the scalability and accuracy of knowledge graph embedding models.
Cited by 6 works. doi:10.3390/info12040147 Open-access PDF
Authors
References
- WordNet
- Freebase
- Translating Embeddings for Modeling Multi-relational Data
- Knowledge Graph Embedding by Translating on Hyperplanes
- An Efficient Boosting Algorithm for Combining Preferences
- A Three-Way Model for Collective Learning on Multi-Relational Data
- Learning to rank
- Embedding Entities and Relations for Learning and Inference in Knowledge Bases
- Knowledge Graph Embedding: A Survey of Approaches and Applications
- Learning to rank for information retrieval