Graph Attention Networks With Local Structure Awareness for Knowledge Graph Completion

被引:9
作者
Ji, Kexi [1 ]
Hui, Bei [1 ,2 ]
Luo, Guangchun [1 ,2 ]
机构
[1] Univ Elect Sci & Technol China, Sch Informat & Software Engn, Chengdu 610054, Peoples R China
[2] Trusted Cloud Comp & Big Data Key Lab Sichuan Pro, Chengdu 610054, Peoples R China
基金
中国国家自然科学基金;
关键词
Knowledge graph embedding; knowledge graph completion; graph attention networks; EMBEDDINGS;
D O I
10.1109/ACCESS.2020.3044343
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Graph neural networks have been proven to be very effective for representation learning of knowledge graphs. Recent methods such as SACN and CompGCN, have achieved the most advanced results in knowledge graph completion. However, previous efforts mostly rely on localized first-order approximations of spectral graph convolutions or first-order neighborhoods, ignoring the abundant local structures like cycles and stars. Therefore, the diverse semantic information beneath these structures is not well-captured, leaving opportunities for better knowledge representation which will finally help KGC. In this work, we propose LSA-GAT, a graph attention network with a novel neighborhood aggregation strategy for knowledge graph completion. The model can take special local structures into account, and derive a sophisticated representation covering both the semantic and structural information. Moreover, the LSA-GAT model is combined with a CNN-based decoder to form an encoder-decoder framework with a carefully designed training process. The experimental results show significant improvement of the proposed LSA-GAT compared to current state-of-the-art methods on FB15k-237 and WN18RR datasets.
引用
收藏
页码:224860 / 224870
页数:11
相关论文
共 28 条
[1]  
Allen C., 2019, ARXIV190109590, P5188
[2]   DBpedia: A nucleus for a web of open data [J].
Auer, Soeren ;
Bizer, Christian ;
Kobilarov, Georgi ;
Lehmann, Jens ;
Cyganiak, Richard ;
Ives, Zachary .
SEMANTIC WEB, PROCEEDINGS, 2007, 4825 :722-+
[3]  
Bollacker K., 2008, Freebase: A collaboratively created, P1247
[4]  
Bordes A., 2013, Adv. Neural Inf. Process. Syst., P2787
[5]  
Carlson A, 2010, AAAI CONF ARTIF INTE, P1306
[6]  
Chauhan J, 2019, ARXIV190601195
[7]   Learning the Structures of Online Asynchronous Conversations [J].
Chen, Jun ;
Wang, Chaokun ;
Lin, Heran ;
Wang, Weiping ;
Cai, Zhipeng ;
Wang, Jianmin .
DATABASE SYSTEMS FOR ADVANCED APPLICATIONS (DASFAA 2017), PT I, 2017, 10177 :19-34
[8]  
Dettmers T, 2018, AAAI CONF ARTIF INTE, P1811
[9]   Open Information Extraction from the Web [J].
Etzioni, Oren ;
Banko, Michele ;
Soderland, Stephen ;
Weld, Daniel S. .
COMMUNICATIONS OF THE ACM, 2008, 51 (12) :68-74
[10]   Identifying Propagation Sources in Networks: State-of-the-Art and Comparative Studies [J].
Jiang, Jiaojiao ;
Wen, Sheng ;
Yu, Shui ;
Xiang, Yang ;
Zhou, Wanlei .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2017, 19 (01) :465-481