Knowledge graph embedding aims at learning low-dimensional
representations for entities and relations in knowledge graph. Previous
knowledge graph embedding methods use just one score to measure the
plausibility of a fact, which can’t fully utilize the latent semantics of
entities and relations. Meanwhile, they ignore the type of relations in
knowledge graph and don’t use fact type explicitly. We instead propose
a model to fuse different scores of a fact and utilize relation and fact
type information to supervise the training process. Specifically, scores
by inner product of a fact and scores by neural network are fused with
different weights to measure the plausibility of a fact. For each fact,
besides modeling the plausibility, the model learns to classify different
relations and differentiate positive facts from negative ones which can be
seen as a muti-task method. Experiments show that our model achieves
better link prediction performance than multiple strong baselines on two
benchmark datasets WN18 and FB15k.
1.National Laboratory of Pattern Recognition, Institute of Automation, Chinese Academy of Sciences, Beijing 100190, China 2.University of Chinese Academy of Sciences, Beijing 100049, China
推荐引用方式 GB/T 7714
Zhou, Bo,Chen, Yubo,Liu, Kang,et al. Relation and Fact Type Supervised Knowledge Graph Embedding via Weighted Scores[C]. 见:. 杭州. 2019-10-18.
修改评论