Browse State-of-the-Art › Inductive Relation Prediction
Inductive Relation Prediction
11 papers with code · 0 benchmarks · 0 datasets archive 2025-07-28
Inductive setting of the knowledge graph completion task. This requires a model to perform link prediction on an entirely new test graph with new set of entities.
Description from the archive archive 2025-07-28.
Benchmarks archive 2025-07-28
No benchmark for this task in the archive.
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
No dataset record in the archive lists this task.
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: 14 · with a code link: 11 · where Syntology ran a sample: 2 (1 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (2 of 14 tagged: 1 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 14 of 14, 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.
-
16 Nov 2019 10 repositories listed Syntology community repositories only · 1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample) · 1 pointer-only (licence)The dominant paradigm for relation prediction in knowledge graphs involves learning and operating on latent representations (i. e., embeddings) of entities and relations.
-
13 Jun 2021 3 repositories listed Syntology official (archive's flag): 2 ran · 12 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified (of 15 harvested samples) · 2 pointer-only (licence)To further improve the capacity of the path formulation, we propose the Neural Bellman-Ford Network (NBFNet), a general graph neural network framework that solves the path formulation with learned operators in the…
-
9 Aug 2024 1 repository listedSpecifically, we propose a single-source initialization approach to initialize edge features only for the target link, which guarantees the relevance of mined rules and target link.
-
21 Dec 2023 1 repository listedTo address this challenge, we propose Anchoring Path Sentence Transformer (APST) by introducing Anchoring Paths (APs) to alleviate the reliance of CPs.
-
7 Sep 2023 1 repository listedIn this work, we bridge the gap between traditional transductive knowledge graph embedding approaches and more recent inductive relation prediction models by introducing a generalized form of harmonic extension which…
-
1 Apr 2023 1 repository listedRelation prediction on knowledge graphs (KGs) is a key research topic.
-
4 Jan 2023 1 repository listedRecent studies on knowledge graphs (KGs) show that path-based methods empowered by pre-trained language models perform well in the provision of inductive and explainable relation predictions.
-
27 Oct 2021 1 repository listedIn this paper, to achieve inductive knowledge graph embedding, we propose a model MorsE, which does not learn embeddings for entities but learns transferable meta-knowledge that can be used to produce entity embeddings.
-
6 Oct 2021 1 repository listedIn this paper, we consider rules as cycles and show that the space of cycles has a unique structure based on the mathematics of algebraic topology.
-
12 Mar 2021 1 repository listedRelation prediction in knowledge graphs is dominated by embedding based methods which mainly focus on the transductive setting.
-
16 Dec 2020 1 repository listedRelation prediction for knowledge graphs aims at predicting missing relationships between entities.
-
Relation-dependent Contrastive Learning with Cluster Sampling for Inductive Relation Prediction22 Nov 2022 0 repositories listedRelation prediction is a task designed for knowledge graph completion which aims to predict missing relationships between entities.
-
A Topological View of Rule Learning in Knowledge Graphs29 Sep 2021 0 repositories listedInductive relation prediction is an important learning task for knowledge graph completion.
-
Inductive Relation Prediction Using Analogy Subgraph Embeddings29 Sep 2021 0 repositories listedPrevailing methods for relation prediction in heterogeneous graphs aim at learning latent representations (i.e., embeddings) of observed nodes and relations, and thus are limited to the transductive setting where the…
Syntology lines on 2 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