.png){kind=icon}
返回
High-Order Neighbors Aware Representation Learning for Knowledge Graph Completion
.png){kind=icon}
PRE
AI
DOI：10.1109/TNNLS.2024.3383873.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
As a building block of knowledge acquisition, knowledge graph completion (KGC) aims at inferring missing facts in knowledge graphs (KGs) automatically. Previous studies mainly focus on graph convolutional network (GCN)-based KG embedding (KGE) to determine the representations of entities and relations, accordingly predicting missing triplets. However, most existing KGE methods suffer from limitations in predicting tail entities that are far away or even unreachable in KGs. This limitation can be attributed to the related high-order information being largely ignored. In this work, we focus on learning the information from the related high-order neighbors in KGs to improve the performance of prediction. Specifically, we first introduce a set of new nodes called pedal nodes to augment the KGs for facilitating message passing between related high-order entities, effectively injecting the information of high-order neighbors into entity representation. Additionally, we propose strength-guided graph neural networks to aggregate neighboring entity representations. To address the issue of transmitting irrelevant higher order information to entities through pedal nodes, which can potentially hurt entity representation, we further propose to dynamically integrate the aggregated representation of each node with its corresponding self-representation. Extensive experiments have been conducted on three benchmark datasets and the results demonstrate the superiority of our method compared to strong baseline models.
Keyword:
Tail
Task analysis
Semantics
Message passing
Knowledge graphs
Convolutional neural networks
Training
Graph convolutional neural network
high-order neighbors
knowledge graph completion (KGC)
representation learning
期刊
IF:
8.9
论文数:
7.6K
被引数:
7.2W
机构
引用论文
暂无论文信息