Knowledge Graph Embedding via Graph Attenuated Attention Networks

Knowledge graphs contain a wealth of real-world knowledge that can provide strong support for artificial intelligence applications. Much progress has been made in knowledge graph completion, state-of-the-art models are based on graph convolutional neural networks. These models automatically extract features, in combination with the features of the graph model, to generate feature embeddings with a strong expressive ability. However, these methods assign the same weights on the relation path in the knowledge graph and ignore the rich information presented in neighbor nodes, which result in incomplete mining of triple features. To this end, we propose Graph Attenuated Attention networks(GAATs), a novel representation method, which integrates an attenuated attention mechanism to assign different weight in different relation path and acquire the information from the neighborhoods. As a result, entities and relations can be learned in any neighbors. Our empirical research provides insight into the effectiveness of the attenuated attention-based models, and we show significant improvement compared to the state-of-the-art methods on two benchmark datasets WN18RR and FB15k-237.

PDF Abstract

Results from the Paper


Task Dataset Model Metric Name Metric Value Global Rank Benchmark
Link Prediction FB15k-237 GAATs MRR 0.547 # 1
Hits@10 0.650 # 1
Hits@3 0.572 # 1
Hits@1 0.512 # 1
MR 187 # 16
Link Prediction WN18RR GAAT MRR 0.467 # 38
Hits@10 0.604 # 6
Hits@3 0.525 # 5
Hits@1 0.424 # 37
MR 1270 # 7

Methods


No methods listed for this paper. Add relevant methods here