{"url":"/task/inductive-knowledge-graph-completion","name":"Inductive knowledge graph completion","slug":"inductive-knowledge-graph-completion","description_markdown":null,"categories":[{"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":20,"papers_with_code":14,"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":1,"subtasks":1,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/inductive-knowledge-graph-completion-on-1","slug":"inductive-knowledge-graph-completion-on-1","dataset":"Wikidata5m-ind","dataset_url":null,"rows_in_archive":3,"metrics":["Hits@1","Hits@10","Hits@3","MRR"],"first_row_in_archive_order":{"model":"BLP-SimplE","paper_title":"Inductive Entity Representations from Text via Link Prediction","paper_url":"/paper/inductive-entity-representations-from-text","paper_date":"2020-10-07","arxiv_id":"2010.03496","code_links":[{"title":"raphaelsty/mkb","url":"https://github.com/raphaelsty/mkb"},{"title":"dfdazac/blp","url":"https://github.com/dfdazac/blp"}],"syntology":{"n":7,"n_ran":0,"n_unverified":7,"n_pointer_only":0}}},{"leaderboard":"/sota/inductive-knowledge-graph-completion-on","slug":"inductive-knowledge-graph-completion-on","dataset":"WN18RR-ind","dataset_url":null,"rows_in_archive":2,"metrics":["Hit@10","Hits@1","Hits@3","MRR"],"first_row_in_archive_order":{"model":"BLP-TransE","paper_title":"Inductive Entity Representations from Text via Link Prediction","paper_url":"/paper/inductive-entity-representations-from-text","paper_date":"2020-10-07","arxiv_id":"2010.03496","code_links":[{"title":"raphaelsty/mkb","url":"https://github.com/raphaelsty/mkb"},{"title":"dfdazac/blp","url":"https://github.com/dfdazac/blp"}],"syntology":{"n":7,"n_ran":0,"n_unverified":7,"n_pointer_only":0}}},{"leaderboard":"/sota/inductive-knowledge-graph-completion-on-fb15k","slug":"inductive-knowledge-graph-completion-on-fb15k","dataset":"FB15k-237-ind","dataset_url":null,"rows_in_archive":1,"metrics":["Hit@1","Hits@10","Hits@3","MRR"],"first_row_in_archive_order":{"model":"BLP-TransE","paper_title":"Inductive Entity Representations from Text via Link Prediction","paper_url":"/paper/inductive-entity-representations-from-text","paper_date":"2020-10-07","arxiv_id":"2010.03496","code_links":[{"title":"raphaelsty/mkb","url":"https://github.com/raphaelsty/mkb"},{"title":"dfdazac/blp","url":"https://github.com/dfdazac/blp"}],"syntology":{"n":7,"n_ran":0,"n_unverified":7,"n_pointer_only":0}}}],"datasets":[{"url":"/dataset/financial-dynamic-knowledge-graph","name":"Financial Dynamic Knowledge Graph","full_name":"","num_papers_in_archive":1}],"subtasks":[{"url":"/task/large-language-model","name":"Large Language Model"}],"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":14,"of":14,"tagged_in_all":20,"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/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/s-2-dn-learning-to-denoise-unconvincing","title":"S$^2$DN: Learning to Denoise Unconvincing Knowledge for Inductive Knowledge Graph Completion","date":"2024-12-20","arxiv_id":"2412.15822","repositories_listed":1,"syntology":null},{"url":"/paper/context-aware-inductive-knowledge-graph","title":"Context-aware Inductive Knowledge Graph Completion with Latent Type Constraints and Subgraph Reasoning","date":"2024-10-22","arxiv_id":"2410.16803","repositories_listed":1,"syntology":null},{"url":"/paper/towards-better-benchmark-datasets-for","title":"Towards Better Benchmark Datasets for Inductive Knowledge Graph Completion","date":"2024-06-14","arxiv_id":"2406.11898","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-knowledge-graph-completion-with","title":"Inductive Knowledge Graph Completion with GNNs and Rules: An Analysis","date":"2023-08-14","arxiv_id":"2308.07942","repositories_listed":1,"syntology":null},{"url":"/paper/ingram-inductive-knowledge-graph-embedding","title":"InGram: Inductive Knowledge Graph Embedding via Relation Graphs","date":"2023-05-31","arxiv_id":"2305.19987","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_unverified":2,"n_pointer_only":3}},{"url":"/paper/relational-message-passing-for-fully","title":"Relational Message Passing for Fully Inductive Knowledge Graph Completion","date":"2022-10-08","arxiv_id":"2210.03994","repositories_listed":1,"syntology":null},{"url":"/paper/statik-structure-and-text-for-inductive","title":"StATIK: Structure and Text for Inductive Knowledge Graph Completion","date":"2022-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/building-rule-hierarchies-for-efficient","title":"Building Rule Hierarchies for Efficient Logical Rule Learning from Knowledge Graphs","date":"2020-06-29","arxiv_id":"2006.16171","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-rule-learning-with-template","title":"Towards Learning Instantiated Logical Rules from Knowledge Graphs","date":"2020-03-13","arxiv_id":"2003.06071","repositories_listed":1,"syntology":null},{"url":"/paper/kepler-a-unified-model-for-knowledge","title":"KEPLER: A Unified Model for Knowledge Embedding and Pre-trained Language Representation","date":"2019-11-13","arxiv_id":"1911.06136","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_unverified":4,"n_pointer_only":5}},{"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},{"url":"/paper/rudas-synthetic-datasets-for-rule-learning","title":"RuDaS: Synthetic Datasets for Rule Learning and Evaluation Tools","date":"2019-09-16","arxiv_id":"1909.07095","repositories_listed":1,"syntology":null}],"syntology_records":4,"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"}}