{"url":"/task/inductive-relation-prediction","name":"Inductive Relation Prediction","slug":"inductive-relation-prediction","description_markdown":"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.","categories":[{"name":"Graphs","url":"/area/graphs"},{"name":"Knowledge Base","url":"/area/knowledge-base"},{"name":"Natural Language Processing","url":"/area/natural-language-processing"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":14,"papers_with_code":11,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":1},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[{"url":"/task/knowledge-graph-completion","name":"Knowledge Graph Completion"}],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":11,"of":11,"tagged_in_all":14,"items":[{"url":"/paper/inductive-relation-prediction-on-knowledge","title":"Inductive Relation Prediction by Subgraph Reasoning","date":"2019-11-16","arxiv_id":"1911.06962","repositories_listed":10,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/neural-bellman-ford-networks-a-general-graph","title":"Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction","date":"2021-06-13","arxiv_id":"2106.06935","repositories_listed":3,"syntology":{"n":15,"n_ran":2,"n_unverified":13,"n_pointer_only":0}},{"url":"/paper/learning-rule-induced-subgraph-1","title":"Learning Rule-Induced Subgraph Representations for Inductive Relation Prediction","date":"2024-08-09","arxiv_id":"2408.07088","repositories_listed":1,"syntology":null},{"url":"/paper/anchoring-path-for-inductive-relation","title":"Anchoring Path for Inductive Relation Prediction in Knowledge Graphs","date":"2023-12-21","arxiv_id":"2312.13596","repositories_listed":1,"syntology":null},{"url":"/paper/extending-transductive-knowledge-graph","title":"Extending Transductive Knowledge Graph Embedding Models for Inductive Logical Relational Inference","date":"2023-09-07","arxiv_id":"2309.03773","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-relation-prediction-from-relational","title":"Inductive Relation Prediction from Relational Paths and Context with Hierarchical Transformers","date":"2023-04-01","arxiv_id":"2304.00215","repositories_listed":1,"syntology":null},{"url":"/paper/multi-aspect-explainable-inductive-relation","title":"Multi-Aspect Explainable Inductive Relation Prediction by Sentence Transformer","date":"2023-01-04","arxiv_id":"2301.01664","repositories_listed":1,"syntology":null},{"url":"/paper/standing-on-the-shoulders-of-predecessors","title":"Meta-Knowledge Transfer for Inductive Knowledge Graph Embedding","date":"2021-10-27","arxiv_id":"2110.14170","repositories_listed":1,"syntology":null},{"url":"/paper/a-topological-view-of-rule-learning-in","title":"Cycle Representation Learning for Inductive Relation Prediction","date":"2021-10-06","arxiv_id":"2110.02510","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-relation-prediction-by-bert","title":"Inductive Relation Prediction by BERT","date":"2021-03-12","arxiv_id":"2103.07102","repositories_listed":1,"syntology":null},{"url":"/paper/communicative-message-passing-for-inductive","title":"Communicative Message Passing for Inductive Relation Reasoning","date":"2020-12-16","arxiv_id":"2012.08911","repositories_listed":1,"syntology":null}],"syntology_records":2,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}