GAKE: Graph Aware Knowledge Embedding

Jun Feng, Minlie Huang, Yang Yang, Xiaoyan Zhu


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.
Anthology ID:
C16-1062
Volume:
Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers
Month:
December
Year:
2016
Address:
Osaka, Japan
Editors:
Yuji Matsumoto, Rashmi Prasad
Venue:
COLING
SIG:
Publisher:
The COLING 2016 Organizing Committee
Note:
Pages:
641–651
Language:
URL:
https://aclanthology.org/C16-1062
DOI:
Bibkey:
Cite (ACL):
Jun Feng, Minlie Huang, Yang Yang, and Xiaoyan Zhu. 2016. GAKE: Graph Aware Knowledge Embedding. In Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers, pages 641–651, Osaka, Japan. The COLING 2016 Organizing Committee.
Cite (Informal):
GAKE: Graph Aware Knowledge Embedding (Feng et al., COLING 2016)
Copy Citation:
PDF:
https://aclanthology.org/C16-1062.pdf
Code
 JuneFeng/GAKE
Data
FB15k