{"url":"/task/inductive-link-prediction","name":"Inductive Link Prediction","slug":"inductive-link-prediction","description_markdown":"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.","categories":[{"name":"Graphs","url":"/area/graphs"},{"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":"archive_url"},"counts":{"papers_tagged":32,"papers_with_code":23,"benchmarks":3,"benchmark_tables_in_archive":3,"benchmark_tables_shown":3,"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":3,"subtasks":0,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/inductive-link-prediction-on-wikidata5m-si","slug":"inductive-link-prediction-on-wikidata5m-si","dataset":"Wikidata5M-SI","dataset_url":"/dataset/wikidata5m-si","rows_in_archive":12,"metrics":["0-shot MRR","1-shot MRR","10-shot MRR"],"first_row_in_archive_order":{"model":"KGT5 (descriptions)","paper_title":"A Benchmark for Semi-Inductive Link Prediction in Knowledge Graphs","paper_url":"/paper/a-benchmark-for-semi-inductive-link","paper_date":"2023-10-18","arxiv_id":"2310.11917","code_links":[{"title":"uma-pi1/wikidata5m-si","url":"https://github.com/uma-pi1/wikidata5m-si"}],"syntology":null}},{"leaderboard":"/sota/inductive-link-prediction-on-ilpc22-large","slug":"inductive-link-prediction-on-ilpc22-large","dataset":"ILPC22-Large","dataset_url":"/dataset/ilpc22-large","rows_in_archive":2,"metrics":["MRR","Hits@100","Hits@10","Hits@5","Hits@3","Hits@1","AMRI"],"first_row_in_archive_order":{"model":"Inductive NodePiece + GNN","paper_title":"An Open Challenge for Inductive Link Prediction on Knowledge Graphs","paper_url":"/paper/an-open-challenge-for-inductive-link","paper_date":"2022-03-03","arxiv_id":"2203.01520","code_links":[{"title":"pykeen/ilpc2022","url":"https://github.com/pykeen/ilpc2022"}],"syntology":null}},{"leaderboard":"/sota/inductive-link-prediction-on-ilpc22-small","slug":"inductive-link-prediction-on-ilpc22-small","dataset":"ILPC22-Small","dataset_url":"/dataset/ilpc22-small","rows_in_archive":2,"metrics":["MRR","Hits@100","Hits@10","Hits@5","Hits@3","Hits@1","AMRI"],"first_row_in_archive_order":{"model":"Inductive NodePiece + GNN","paper_title":"An Open Challenge for Inductive Link Prediction on Knowledge Graphs","paper_url":"/paper/an-open-challenge-for-inductive-link","paper_date":"2022-03-03","arxiv_id":"2203.01520","code_links":[{"title":"pykeen/ilpc2022","url":"https://github.com/pykeen/ilpc2022"}],"syntology":null}}],"datasets":[{"url":"/dataset/ilpc22-large","name":"ILPC22-Large","full_name":"ILPC22-Large","num_papers_in_archive":1},{"url":"/dataset/ilpc22-small","name":"ILPC22-Small","full_name":"ILPC22-Small","num_papers_in_archive":1},{"url":"/dataset/wikidata5m-si","name":"Wikidata5M-SI","full_name":"","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[{"url":"/task/link-prediction","name":"Link Prediction"}],"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":23,"of":23,"tagged_in_all":32,"items":[{"url":"/paper/neighborhood-aware-scalable-temporal-network","title":"Neighborhood-aware Scalable Temporal Network Representation Learning","date":"2022-09-02","arxiv_id":"2209.01084","repositories_listed":2,"syntology":{"n":8,"n_ran":0,"n_unverified":8,"n_pointer_only":0}},{"url":"/paper/improving-inductive-link-prediction-using","title":"Improving Inductive Link Prediction Using Hyper-Relational Facts","date":"2021-07-10","arxiv_id":"2107.04894","repositories_listed":2,"syntology":null},{"url":"/paper/inductive-entity-representations-from-text","title":"Inductive Entity Representations from Text via Link Prediction","date":"2020-10-07","arxiv_id":"2010.03496","repositories_listed":2,"syntology":{"n":7,"n_ran":0,"n_unverified":7,"n_pointer_only":0}},{"url":"/paper/inductive-link-prediction-on-n-ary-relational","title":"Inductive Link Prediction on N-ary Relational Facts via Semantic Hypergraph Reasoning","date":"2025-03-26","arxiv_id":"2503.20676","repositories_listed":1,"syntology":null},{"url":"/paper/leap-inductive-link-prediction-via-learnable","title":"Leap: Inductive Link Prediction via Learnable TopologyAugmentation","date":"2025-03-05","arxiv_id":"2503.03331","repositories_listed":1,"syntology":null},{"url":"/paper/reevaluation-of-inductive-link-prediction","title":"Reevaluation of Inductive Link Prediction","date":"2024-09-30","arxiv_id":"2409.20130","repositories_listed":1,"syntology":null},{"url":"/paper/moti-mathcal-ve-a-drug-target-interaction","title":"MOTIVE: A Drug-Target Interaction Graph For Inductive Link Prediction","date":"2024-06-12","arxiv_id":"2406.08649","repositories_listed":1,"syntology":null},{"url":"/paper/multi-label-zero-shot-product-attribute-value","title":"Multi-Label Zero-Shot Product Attribute-Value Extraction","date":"2024-02-13","arxiv_id":"2402.08802","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-link-prediction-in-knowledge-graphs","title":"Inductive Link Prediction in Knowledge Graphs using Path-based Neural Networks","date":"2023-12-16","arxiv_id":"2312.10293","repositories_listed":1,"syntology":null},{"url":"/paper/towards-enhancing-relational-rules-for","title":"Towards Enhancing Relational Rules for Knowledge Graph Link Prediction","date":"2023-10-20","arxiv_id":"2310.13411","repositories_listed":1,"syntology":null},{"url":"/paper/a-benchmark-for-semi-inductive-link","title":"A Benchmark for Semi-Inductive Link Prediction in Knowledge Graphs","date":"2023-10-18","arxiv_id":"2310.11917","repositories_listed":1,"syntology":null},{"url":"/paper/event-prediction-using-case-based-reasoning","title":"Event Prediction using Case-Based Reasoning over Knowledge Graphs","date":"2023-09-21","arxiv_id":"2309.12423","repositories_listed":1,"syntology":null},{"url":"/paper/towards-few-shot-inductive-link-prediction-on","title":"Towards Few-shot Inductive Link Prediction on Knowledge Graphs: A Relational Anonymous Walk-guided Neural Process Approach","date":"2023-06-26","arxiv_id":"2307.01204","repositories_listed":1,"syntology":null},{"url":"/paper/double-permutation-equivariance-for-knowledge","title":"Double Equivariance for Inductive Link Prediction for Both New Nodes and New Relation Types","date":"2023-02-02","arxiv_id":"2302.01313","repositories_listed":1,"syntology":{"n":6,"n_ran":0,"n_unverified":6,"n_pointer_only":0}},{"url":"/paper/irt2-inductive-linking-and-ranking-in","title":"IRT2: Inductive Linking and Ranking in Knowledge Graphs of Varying Scale","date":"2023-01-02","arxiv_id":"2301.00716","repositories_listed":1,"syntology":null},{"url":"/paper/raild-towards-leveraging-relation-features","title":"RAILD: Towards Leveraging Relation Features for Inductive Link Prediction In Knowledge Graphs","date":"2022-11-21","arxiv_id":"2211.11407","repositories_listed":1,"syntology":null},{"url":"/paper/disconnected-emerging-knowledge-graph","title":"Disconnected Emerging Knowledge Graph Oriented Inductive Link Prediction","date":"2022-09-03","arxiv_id":"2209.01397","repositories_listed":1,"syntology":null},{"url":"/paper/subgraph-neighboring-relations-infomax-for","title":"Subgraph Neighboring Relations Infomax for Inductive Link Prediction on Knowledge Graphs","date":"2022-07-28","arxiv_id":"2208.00850","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_unverified":3,"n_pointer_only":10}},{"url":"/paper/an-open-challenge-for-inductive-link","title":"An Open Challenge for Inductive Link Prediction on Knowledge Graphs","date":"2022-03-03","arxiv_id":"2203.01520","repositories_listed":1,"syntology":null},{"url":"/paper/how-neural-processes-improve-graph-link","title":"How Neural Processes Improve Graph Link Prediction","date":"2021-09-30","arxiv_id":"2109.14894","repositories_listed":1,"syntology":null},{"url":"/paper/topology-aware-correlations-between-relations","title":"Topology-Aware Correlations Between Relations for Inductive Link Prediction in Knowledge Graphs","date":"2021-03-05","arxiv_id":"2103.03642","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_unverified":2,"n_pointer_only":6}},{"url":"/paper/inductive-link-prediction-for-nodes-having","title":"Inductive Link Prediction for Nodes Having Only Attribute Information","date":"2020-07-16","arxiv_id":"2007.08053","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/drum-end-to-end-differentiable-rule-mining-on","title":"DRUM: End-To-End Differentiable Rule Mining On Knowledge Graphs","date":"2019-10-31","arxiv_id":"1911.00055","repositories_listed":1,"syntology":null}],"syntology_records":6,"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"}}