Learning Knowledge Graph Embedding in Semantic Space: A Novel Bi-linear Semantic Matching Method

摘要

Knowledge Graphs represent facts with triples containing head entity $h$, tail entity $t$ and relation $r$ which facilitate applications of many scenarios, for example intelligent web search, community detection and question answering. Knowledge Graph Embedding (KGE) represents elements of triples in a low-dimensional continuous vector space. Though it has been widely studied by both academic and industry communities, most researches focus on learning embeddings of entities and relations separately rather than considering the interactive semantic information between them. However, neither relations nor entities exist lonely out of context. In this paper, we define an interactive semantic space to model the context of triples and propose a novel Bi-linear Semantic Matching Method using Convolutional networks (BiSC). Specifically, we use 1D convolutional neural networks to extract features of the interactive semantics and then compute the similarity scores in the bi-linear space. Compared to existing complex graph network methods, BiSC needs lower computational cost to reach competitive results on link prediction task. The consistent state-of-the-art performance through extensive experiments over two benchmarks demonstrates the advantages of the proposed BiSC model. Further analysis on convergence study and case study of interactive semantic space show the efficiency of our model.