Browse State-of-the-Art › Inductive Link Prediction
Inductive Link Prediction
23 papers with code · 3 benchmarks · 3 datasets archive 2025-07-28
In inductive link prediction inference is performed on a new, unseen graph whereas classical transductive link prediction performs both training and inference on the same graph.
Description from the archive archive 2025-07-28.
Benchmarks archive 2025-07-28
3 leaderboard tables shown for this task, 3 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted.
| Dataset | Best model (first row in archive order) | Paper | Code | Syntology | Compare |
|---|---|---|---|---|---|
| Wikidata5M-SI (12 rows) | KGT5 (descriptions) | A Benchmark for Semi-Inductive Link Prediction in Knowledge Graphs | code | — | Compare |
| ILPC22-Large (2 rows) | Inductive NodePiece + GNN | An Open Challenge for Inductive Link Prediction on Knowledge Graphs | code | — | Compare |
| ILPC22-Small (2 rows) | Inductive NodePiece + GNN | An Open Challenge for Inductive Link Prediction on Knowledge Graphs | code | — | Compare |
Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. Each line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the row's paper, the line starts with that repository's state (“official” is the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from. A dash means no Syntology record for that paper, not a recorded non-run. Each “ran” line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
3 datasets whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Parent tasks archive 2025-07-28
Papers archive 2025-07-28
archive papers tagged: 32 · with a code link: 23 · where Syntology ran a sample: 5 (5 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (5 of 32 tagged: 5 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 32 of 32, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.
Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from. The first sentence of the abstract is shown for the first 30 papers; every abstract is on its paper's page.
-
2 Sep 2022 2 repositories listed Syntology official (archive's flag): 4 ran · 4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified (of 8 harvested samples)Such a dictionary representation records a downsampled set of the neighboring nodes as keys, and allows fast construction of structural features for a joint neighborhood of multiple nodes.
-
10 Jul 2021 2 repositories listedIn this work, we classify different inductive settings and study the benefits of employing hyper-relational KGs on a wide range of semi- and fully inductive link prediction tasks powered by recent advancements in graph…
-
7 Oct 2020 2 repositories listed Syntology official (archive's flag): 7 ran · 7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 7 harvested samples)However, the extent to which these representations learned for link prediction generalize to other tasks is unclear.
-
26 Mar 2025 1 repository listedThe results highlight the superiority of the n-ary subgraph reasoning framework and the exceptional inductive ability of NS-HART.
-
5 Mar 2025 1 repository listedLink prediction is a crucial task in many downstream applications of graph machine learning.
-
30 Sep 2024 1 repository listedWithin this paper, we show that the evaluation protocol currently used for inductive link prediction is heavily flawed as it relies on ranking the true entity in a small set of randomly sampled negative entities.
-
12 Jun 2024 1 repository listedDrug-target interaction (DTI) prediction is crucial for identifying new therapeutics and detecting mechanisms of action.
-
13 Feb 2024 1 repository listedWe propose HyperPAVE, a multi-label zero-shot attribute value extraction model that leverages inductive inference in heterogeneous hypergraphs.
-
16 Dec 2023 1 repository listedEmbedding-based models usually need fine-tuning on new entity embeddings, and hence are difficult to be directly applied to inductive link prediction tasks.
-
20 Oct 2023 1 repository listedTo address these issues, we propose a novel knowledge graph reasoning approach, the Relational rUle eNhanced Graph Neural Network (RUN-GNN).
-
18 Oct 2023 1 repository listedSemi-inductive link prediction (LP) in knowledge graphs (KG) is the task of predicting facts for new, previously unseen entities based on context information.
-
21 Sep 2023 1 repository listedTo generalize our methods beyond the domain of event prediction, we frame our task as a 2-hop LP task, where the first hop is a causal relation connecting a cause event to a new effect event and the second hop is a…
-
26 Jun 2023 1 repository listedPrevious methods are limited to transductive scenarios, where entities exist in the knowledge graphs, so they are unable to handle unseen entities.
-
2 Feb 2023 1 repository listed Syntology official: harvested, nothing ran · 0 ran · 6 unverified (of 6 harvested samples)The task of fully inductive link prediction in knowledge graphs has gained significant attention, with various graph neural networks being proposed to address it.
-
2 Jan 2023 1 repository listedOur focus is on inductive link prediction models as a basis for practical tools that support knowledge engineers with exploring text collections and discovering and linking new (so-called open-world) entities to the…
-
21 Nov 2022 1 repository listedIn this work, a novel Relation Aware Inductive Link preDiction (RAILD) is proposed for KG completion which learns representations for both unseen entities and unseen relations.
-
3 Sep 2022 1 repository listedA more challenging scenario is that emerging KGs consist of only unseen entities, called as disconnected emerging KGs (DEKGs).
-
28 Jul 2022 1 repository listed Syntology official (archive's flag): 7 ran · 7 ran (of which 7 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified; every one of the 7 samples that ran constructed an object rather than computing a result (of 10 harvested samples) · 10 pointer-only (licence)Inductive link prediction for knowledge graph aims at predicting missing links between unseen entities, those not shown in training stage.
-
3 Mar 2022 1 repository listedAn emerging trend in representation learning over knowledge graphs (KGs) moves beyond transductive link prediction tasks over a fixed set of known entities in favor of inductive tasks that imply training on one graph…
-
30 Sep 2021 1 repository listedLink prediction is a fundamental problem in graph data analysis.
-
5 Mar 2021 1 repository listed Syntology official (archive's flag): 4 ran · 4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 4 samples that ran constructed an object rather than computing a result (of 6 harvested samples) · 6 pointer-only (licence)TACT is inspired by the observation that the semantic correlation between two relations is highly correlated to their topological structure in knowledge graphs.
-
16 Jul 2020 1 repository listed Syntology official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified (of 2 harvested samples)In attributed graphs, both the structure and attribute information can be utilized for link prediction.
-
31 Oct 2019 1 repository listedDespite the importance of inductive link prediction, most previous works focused on transductive link prediction and cannot manage previously unseen entities.
-
Fast-and-Frugal Text-Graph Transformers are Effective Link Predictors13 Aug 2024 0 repositories listedWe propose Fast-and-Frugal Text-Graph (FnF-TG) Transformers, a Transformer-based framework that unifies textual and structural information for inductive link prediction in text-attributed knowledge graphs.
-
Link Prediction with Relational Hypergraphs6 Feb 2024 0 repositories listedLink prediction with knowledge graphs has been thoroughly studied in graph machine learning, leading to a rich landscape of graph neural network architectures with successful applications.
-
Learning Complete Topology-Aware Correlations Between Relations for Inductive Link Prediction20 Sep 2023 0 repositories listedInductive link prediction -- where entities during training and inference stages can be different -- has shown great potential for completing evolving knowledge graphs in an entity-independent manner.
-
Towards Semantically Enriched Embeddings for Knowledge Graph Completion31 Jul 2023 0 repositories listedEmbedding based Knowledge Graph (KG) Completion has gained much attention over the past few years.
-
Disentangling Node Attributes from Graph Topology for Improved Generalizability in Link Prediction17 Jul 2023 0 repositories listedOur proposed method, UPNA (Unsupervised Pre-training of Node Attributes), solves the inductive link prediction problem by learning a function that takes a pair of node attributes and predicts the probability of an edge…
-
A Multi-Task Perspective for Link Prediction with New Relation Types and Nodes12 Jul 2023 0 repositories listedThe task of inductive link prediction in (discrete) attributed multigraphs infers missing attributed links (relations) between nodes in new test multigraphs.
-
Link Prediction with Contextualized Self-Supervision25 Jan 2022 0 repositories listedLink prediction aims to infer the link existence between pairs of nodes in networks/graphs.
-
Barlow Graph Auto-Encoder for Unsupervised Network Embedding29 Oct 2021 0 repositories listed
-
Subgraph-aware Few-Shot Inductive Link Prediction via Meta-Learning26 Jul 2021 0 repositories listed
Syntology lines on 6 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections