Graph transformer for link prediction on N-ary facts

基于 N 元事实的链接预测图转换器

阅读:1

Abstract

Hyper-relational knowledge graphs build upon traditional knowledge graphs to enhance the diversity and complexity of information representation. They achieve this by integrating multi-dimensional auxiliary information with standard triples. However, this characteristic introduces certain challenges to the task of N-ary Fact Link Prediction. Unlike binary relational knowledge representations, N-ary Facts have more complex and varied expression forms. To address the issue of insufficient utilization of heterogeneous graph structure information in existing N-ary Fact representation methods, this paper proposes an N-ary graph Transformer model. This model incorporates a new attention mechanism based on N-ary structural bias. By improving the representation of N-ary heterogeneous graphs, it more accurately identifies key associations in recommendation scenarios. Experimental validations on the JF17K, Wikipeople, and WD50K datasets demonstrate that the NAGT model outperforms comparative methods in extracting structural information. It effectively completes the knowledge graph and shows both efficiency and robustness in experiments related to the N-ary Fact Link Prediction task.

特别声明

1、本页面内容包含部分的内容是基于公开信息的合理引用;引用内容仅为补充信息,不代表本站立场。

2、若认为本页面引用内容涉及侵权,请及时与本站联系,我们将第一时间处理。

3、其他媒体/个人如需使用本页面原创内容,需注明“来源:[生知库]”并获得授权;使用引用内容的,需自行联系原作者获得许可。

4、投稿及合作请联系:info@biocloudy.com。