推论
计算机科学
图形
编码
人工智能
数据挖掘
模式识别(心理学)
机器学习
理论计算机科学
数学
生物化学
化学
基因
作者
Yuejia Wu,Jian-tao Zhou
标识
DOI:10.1016/j.ins.2023.119473
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI