SOTAVerified

Efficient Parallel Translating Embedding For Knowledge Graphs

2017-03-30Code Available0· sign in to hype

Denghui Zhang, Manling Li, Yantao Jia, Yuanzhuo Wang, Xue-Qi Cheng

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

Knowledge graph embedding aims to embed entities and relations of knowledge graphs into low-dimensional vector spaces. Translating embedding methods regard relations as the translation from head entities to tail entities, which achieve the state-of-the-art results among knowledge graph embedding methods. However, a major limitation of these methods is the time consuming training process, which may take several days or even weeks for large knowledge graphs, and result in great difficulty in practical applications. In this paper, we propose an efficient parallel framework for translating embedding methods, called ParTrans-X, which enables the methods to be paralleled without locks by utilizing the distinguished structures of knowledge graphs. Experiments on two datasets with three typical translating embedding methods, i.e., TransE [3], TransH [17], and a more efficient variant TransE- AdaGrad [10] validate that ParTrans-X can speed up the training process by more than an order of magnitude.

Tasks

Benchmark Results

DatasetModelMetricClaimedVerifiedStatus
FB15kParTransHHits@100.47Unverified
FB15k (filtered)ParTransHHits@1065.7Unverified
WN18ParTransHHits@100.67Unverified
WN18 (filtered)ParTransHHits@1076.6Unverified

Reproductions