A neighborhood-aware graph self-attention mechanism-based pre-training model for Knowledge Graph Reasoning

被引:8
作者
Wu, Yuejia [1 ,2 ,3 ,4 ,5 ,6 ,7 ]
Zhou, Jian-tao [1 ,2 ,3 ,4 ,5 ,6 ,7 ]
机构
[1] Inner Mongolia Univ, Coll Comp Sci, Hohhot, Peoples R China
[2] Natl & Local Joint Engn Res Ctr Intelligent Inform, Hohhot, Peoples R China
[3] Minist Educ, Engn Res Ctr Ecol Big Data, Hohhot, Peoples R China
[4] Inner Mongolia Engn Lab Cloud Comp & Serv Softwar, Hohhot, Peoples R China
[5] Inner Mongolia Key Lab Social Comp & Data Proc, Hohhot, Peoples R China
[6] Inner Mongolia Key Lab Discipline Inspect & Superv, Hohhot, Peoples R China
[7] Inner Mongolia Engn Lab Big Data Anal Technol, Hohhot, Peoples R China
基金
中国国家自然科学基金;
关键词
Knowledge Graph Reasoning; Graph self-attention mechanism; Neighborhood information; Pre-training model; Link prediction;
D O I
10.1016/j.ins.2023.119473
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Knowledge Graph Reasoning (KGR) is an effective method to ameliorate incompleteness and sparsity problems, which infers new knowledge based on existing knowledge. The Graph Neural Network (GNN)-based approaches can obtain advanced effectiveness. However, it still suffers from some problems such as obtaining insufficient graph features, introducing noises, ignoring path connectivity, and acquiring incomplete neighborhood information. This paper proposes a neighborhood-aware (NA) graph self-attention mechanism-based pre-training model for KGR, namely NA-KGR. The proposed model is composed of two phases. The first phase is an enhanced graph attention network, which can use the weighted characteristics of its neighbors to represent and encode the entities that are most likely to have a positive effect on reasoning. The second phase is a neighborhood-aware self-attention mechanism, which makes the model more able to obtain information from the neighbor entities for inference by increasing an adaptive entity similarity matrix when calculating the attention score. Moreover, we propose a pre-training pattern based on neighborhood-aware random walk sampling and general subgraph structure sampling to improve NA-KGR's generalization ability. Extensive comparison and ablation experimental results on various benchmarks unambiguously demonstrate that the proposed NA-KGR model can obtain the state-of-the-art results of current GNN-based methods.
引用
收藏
页数:33
相关论文
共 50 条
[1]   Friends and neighbors on the Web [J].
Adamic, LA ;
Adar, E .
SOCIAL NETWORKS, 2003, 25 (03) :211-230
[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]  
Bai Y., 2022, arXiv
[4]  
Balazevic I, 2019, Arxiv, DOI [arXiv:1901.09590, DOI 10.48550/ARXIV.1901.09590]
[5]  
Bastos A, 2021, Arxiv, DOI arXiv:2108.05774
[6]  
Bollacker KD., 2008, P ACM SIGMOD INT C M, P1247, DOI DOI 10.1145/1376616.1376746
[7]  
Bordes A., 2013, P 26 INT C NEUR INF, V2, P2787
[8]  
Chao LL, 2021, Arxiv, DOI arXiv:2011.03798
[9]   Hybrid Transformer with Multi-level Fusion for Multimodal Knowledge Graph Completion [J].
Chen, Xiang ;
Zhang, Ningyu ;
Li, Lei ;
Deng, Shumin ;
Tan, Chuanqi ;
Xu, Changliang ;
Huang, Fei ;
Si, Luo ;
Chen, Huajun .
PROCEEDINGS OF THE 45TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '22), 2022, :904-915
[10]  
Dettmers T, 2018, AAAI CONF ARTIF INTE, P1811