.png){kind=icon}
返回
Fully-inductive link prediction with path-based graph neural network: A comparative analysis
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2024.128484.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Recently, fully-inductive link prediction in knowledge graphs (KGs) has aimed to predict missing links between unseen-unseen entities, independently completing evolving KGs. The latest literature emphasizes path-based graph neural network (GNN) methods, which combine traditional path-based methods with popular GNN methods, possessing generalization capability, interpretability, scalability, and high model capacity under the inductive setting. This paper presents the first comparative analysis of fully-inductive link prediction using path-based GNNs. First, we comprehensively review and summarize the research of six relevant models, divided into relational digraph-based models and Bellman-Ford algorithm-based models. Based on this, we conduct a comprehensive analysis of these models in terms of effectiveness and efficiency (including runtime, memory, and learning curves), and compared them with two subgraph-based models. Furthermore, we delve into the impact of factors such as message functions, aggregation functions, and negative sampling in the loss function on path-based GNNs. Finally, we provide an outlook on future research directions.
Keyword:
Knowledge graph
Inductive link prediction
Graph neural network
Unseen entity
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Kinematic analysis of limb movements in neuropsychological research: Subtle deficits and recovery of function.神经心理学研究中肢体运动的运动学分析: 细微的缺陷和功能的恢复。
PREAI
分享收藏Ovulation response and fertilization failure in immature rats induced to superovulate.png)
Reproduction
OAAI
ReproductionIF0
OAAI分享收藏VAE-PGN based Abstractive Model in Multi-stage Architecture for Text Summarization基于多阶段架构的VAE-PGN抽象式文本摘要模型
OAAI
OAAI分享收藏
查看更多内容