SOTAVerified

GAKE: Graph Aware Knowledge Embedding

2016-12-01COLING 2016Code Available0· sign in to hype

Jun Feng, Minlie Huang, Yang Yang, Xiaoyan Zhu

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

Knowledge embedding, which projects triples in a given knowledge base to d-dimensional vectors, has attracted considerable research efforts recently. Most existing approaches treat the given knowledge base as a set of triplets, each of whose representation is then learned separately. However, as a fact, triples are connected and depend on each other. In this paper, we propose a graph aware knowledge embedding method (GAKE), which formulates knowledge base as a directed graph, and learns representations for any vertices or edges by leveraging the graph's structural information. We introduce three types of graph context for embedding: neighbor context, path context, and edge context, each reflects properties of knowledge from different perspectives. We also design an attention mechanism to learn representative power of different vertices or edges. To validate our method, we conduct several experiments on two tasks. Experimental results suggest that our method outperforms several state-of-art knowledge embedding models.

Reproductions