Entity Alignment (EA) has attracted widespread attention in both academia and industry, which aims to seek entities with same meanings from different Knowledge Graphs (KGs). There are substantial multi-step relation paths between entities in KGs, indicating the semantic relations of entities. However, existing methods rarely consider path information because not all natural paths facilitate for EA judgment. In this paper, we propose a more effective entity alignment framework, RPR-RHGT, which integrates relation and path structure information, as well as the heterogeneous information in KGs. Impressively, an initial reliable path reasoning algorithm is developed to generate the paths favorable for EA task from the relation structures of KGs, which is the first algorithm in the literature to successfully use unrestricted path information. In addition, to efficiently capture heterogeneous features in entity neighborhoods, a relation-aware heterogeneous graph transformer is designed to model the relation and path structures of KGs. Extensive experiments on three well-known datasets show RPR-RHGT significantly outperforms 11 state-of-the-art methods, exceeding the best performing baseline up to 8.62% on Hits@1. We also show its better performance than the baselines on different ratios of training set, and harder datasets.
翻译:在学术界和行业中,实体协调(EA)引起了广泛的注意,目的是从不同的知识图表中寻找具有相同含义的实体。在KGs的实体之间,存在着大量多步骤关系路径,表明实体的语义关系。然而,现有方法很少考虑路径信息,因为并非所有自然路径都有利于EA的判断。在本文中,我们提议了一个更有效的实体协调框架,RPR-RHGT,它整合了关系和路径结构信息,以及KGs中的各种信息。令人印象深刻的是,正在开发一个初步可靠的路径推理算法,以便从KGs的关系结构中产生有利于EA任务的路径,而KGs是文献中成功使用不受限制路径信息的第一个算法。此外,为了有效地捕捉实体周边的异性特征,我们设计了一种具有关联性的多元图形变异器,以模拟KGs的关系和路径结构。在三个众所周知的数据集上进行的广泛实验显示RPR-RHHGT明显超越了11个状态方法,超过了最佳执行基线,最高达8.62%,在HTs@set1中,我们还显示其业绩比数据要好得多。