The reviewed record of science sign in
Pith

arxiv: 2507.07595 · v1 · pith:DSDOTRND · submitted 2025-07-10 · cs.AI · cs.LG

Context Pooling: Query-specific Graph Pooling for Generic Inductive Link Prediction in Knowledge Graphs

Reviewed by Pithpith:DSDOTRNDopen to challenge →

classification cs.AI cs.LG
keywords poolingcontextlinkgraphgraphsinductiveknowledgemodels
0
0 comments X
read the original abstract

Recent investigations on the effectiveness of Graph Neural Network (GNN)-based models for link prediction in Knowledge Graphs (KGs) show that vanilla aggregation does not significantly impact the model performance. In this paper, we introduce a novel method, named Context Pooling, to enhance GNN-based models' efficacy for link predictions in KGs. To our best of knowledge, Context Pooling is the first methodology that applies graph pooling in KGs. Additionally, Context Pooling is first-of-its-kind to enable the generation of query-specific graphs for inductive settings, where testing entities are unseen during training. Specifically, we devise two metrics, namely neighborhood precision and neighborhood recall, to assess the neighbors' logical relevance regarding the given queries, thereby enabling the subsequent comprehensive identification of only the logically relevant neighbors for link prediction. Our method is generic and assessed by being applied to two state-of-the-art (SOTA) models on three public transductive and inductive datasets, achieving SOTA performance in 42 out of 48 settings.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.