{"url":"/task/knowledge-graph-completion","name":"Knowledge Graph Completion","slug":"knowledge-graph-completion","description_markdown":"Knowledge graphs $G$ are represented as a collection of triples $\\\\{(h, r, t)\\\\}\\subseteq E\\times R\\times E$, where $E$ and $R$ are the entity set and relation set. The task of **Knowledge Graph Completion** is to either predict unseen relations $r$ between two existing entities: $(h, ?, t)$ or predict the tail entity $t$ given the head entity and the query relation: $(h, r, ?)$.\r\n\r\n\r\n<span class=\"description-source\">Source: [One-Shot Relational Learning for Knowledge Graphs ](https://arxiv.org/abs/1808.09040)</span>","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":"archive_url"},"counts":{"papers_tagged":482,"papers_with_code":251,"benchmarks":7,"benchmark_tables_in_archive":7,"benchmark_tables_shown":7,"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":16,"subtasks":4,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/knowledge-graph-completion-on-fb15k-237","slug":"knowledge-graph-completion-on-fb15k-237","dataset":"FB15k-237","dataset_url":"/dataset/fb15k-237","rows_in_archive":4,"metrics":["Hits@10","Hits@1","Hits@3","MR","MRR"],"first_row_in_archive_order":{"model":"KBGAT","paper_title":"Learning Attention-based Embeddings for Relation Prediction in Knowledge Graphs","paper_url":"/paper/learning-attention-based-embeddings-for","paper_date":"2019-06-04","arxiv_id":"1906.01195","code_links":[{"title":"deepakn97/relationPrediction","url":"https://github.com/deepakn97/relationPrediction"},{"title":"KXY-PUBLIC/NASE","url":"https://github.com/KXY-PUBLIC/NASE"}],"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}}},{"leaderboard":"/sota/knowledge-graph-completion-on-dbp-5l","slug":"knowledge-graph-completion-on-dbp-5l","dataset":"DBP-5L (Greek)","dataset_url":"/dataset/dbp-5l","rows_in_archive":3,"metrics":["MRR"],"first_row_in_archive_order":{"model":"JMAC","paper_title":"Joint Multilingual Knowledge Graph Completion and Alignment","paper_url":"/paper/joint-multilingual-knowledge-graph-completion","paper_date":"2022-10-17","arxiv_id":"2210.08922","code_links":[{"title":"vinhsuhi/jmac","url":"https://github.com/vinhsuhi/jmac"}],"syntology":null}},{"leaderboard":"/sota/knowledge-graph-completion-on-dbp-5l-english","slug":"knowledge-graph-completion-on-dbp-5l-english","dataset":"DBP-5L (English)","dataset_url":"/dataset/dbp-5l-english","rows_in_archive":3,"metrics":["MRR"],"first_row_in_archive_order":{"model":"JMAC","paper_title":"Joint Multilingual Knowledge Graph Completion and Alignment","paper_url":"/paper/joint-multilingual-knowledge-graph-completion","paper_date":"2022-10-17","arxiv_id":"2210.08922","code_links":[{"title":"vinhsuhi/jmac","url":"https://github.com/vinhsuhi/jmac"}],"syntology":null}},{"leaderboard":"/sota/knowledge-graph-completion-on-dpb-5l-french","slug":"knowledge-graph-completion-on-dpb-5l-french","dataset":"DPB-5L (French)","dataset_url":"/dataset/dpb-5l-french","rows_in_archive":3,"metrics":["MRR"],"first_row_in_archive_order":{"model":"JMAC","paper_title":"Joint Multilingual Knowledge Graph Completion and Alignment","paper_url":"/paper/joint-multilingual-knowledge-graph-completion","paper_date":"2022-10-17","arxiv_id":"2210.08922","code_links":[{"title":"vinhsuhi/jmac","url":"https://github.com/vinhsuhi/jmac"}],"syntology":null}},{"leaderboard":"/sota/knowledge-graph-completion-on-wn18rr","slug":"knowledge-graph-completion-on-wn18rr","dataset":"WN18RR","dataset_url":"/dataset/wn18rr","rows_in_archive":2,"metrics":["Hits@3","Hits@1","Hits@10"],"first_row_in_archive_order":{"model":"HAKE","paper_title":"Learning Hierarchy-Aware Knowledge Graph Embeddings for Link Prediction","paper_url":"/paper/learning-hierarchy-aware-knowledge-graph","paper_date":"2019-11-21","arxiv_id":"1911.09419","code_links":[{"title":"MIRALab-USTC/KGE-HAKE","url":"https://github.com/MIRALab-USTC/KGE-HAKE"},{"title":"thu-keg/eakit","url":"https://github.com/thu-keg/eakit"},{"title":"MIRALab-USTC/KGE-DURA","url":"https://github.com/MIRALab-USTC/KGE-DURA"},{"title":"miralab-ustc/qe-cone","url":"https://github.com/miralab-ustc/qe-cone"},{"title":"kamigaito/icml2022","url":"https://github.com/kamigaito/icml2022"},{"title":"guixiangyu1/KGE-HAKE-master","url":"https://github.com/guixiangyu1/KGE-HAKE-master"},{"title":"jiean001/models_m","url":"https://github.com/jiean001/models_m/tree/main/hake"},{"title":"kingcong/models","url":"https://github.com/kingcong/models/tree/main/hake"},{"title":"zyjcs/KGE-HAE","url":"https://github.com/zyjcs/KGE-HAE"}],"syntology":{"n":8,"n_ran":2,"n_unverified":6,"n_pointer_only":1}}},{"leaderboard":"/sota/knowledge-graph-completion-on-dbbook2014","slug":"knowledge-graph-completion-on-dbbook2014","dataset":"DBbook2014","dataset_url":null,"rows_in_archive":1,"metrics":["Hits@10","Mean Rank"],"first_row_in_archive_order":{"model":"KTUP (soft)","paper_title":"Unifying Knowledge Graph Learning and Recommendation: Towards a Better Understanding of User Preferences","paper_url":"/paper/unifying-knowledge-graph-learning-and","paper_date":"2019-02-17","arxiv_id":"1902.06236","code_links":[{"title":"TaoMiner/joint-kg-recommender","url":"https://github.com/TaoMiner/joint-kg-recommender"}],"syntology":null}},{"leaderboard":"/sota/knowledge-graph-completion-on-movielens-1m","slug":"knowledge-graph-completion-on-movielens-1m","dataset":"MovieLens 1M","dataset_url":"/dataset/movielens","rows_in_archive":1,"metrics":["Hits@10","Mean Rank"],"first_row_in_archive_order":{"model":"KTUP (soft)","paper_title":"Unifying Knowledge Graph Learning and Recommendation: Towards a Better Understanding of User Preferences","paper_url":"/paper/unifying-knowledge-graph-learning-and","paper_date":"2019-02-17","arxiv_id":"1902.06236","code_links":[{"title":"TaoMiner/joint-kg-recommender","url":"https://github.com/TaoMiner/joint-kg-recommender"}],"syntology":null}}],"datasets":[{"url":"/dataset/movielens","name":"MovieLens","full_name":"MovieLens","num_papers_in_archive":1246},{"url":"/dataset/fb15k","name":"FB15k","full_name":"Freebase 15K","num_papers_in_archive":641},{"url":"/dataset/wn18","name":"WN18","full_name":"WordNet18","num_papers_in_archive":485},{"url":"/dataset/fb15k-237","name":"FB15k-237","full_name":"","num_papers_in_archive":452},{"url":"/dataset/wn18rr","name":"WN18RR","full_name":"","num_papers_in_archive":394},{"url":"/dataset/wiki-one","name":"Wiki-One","full_name":"","num_papers_in_archive":16},{"url":"/dataset/codex-medium","name":"CoDEx Medium","full_name":"","num_papers_in_archive":5},{"url":"/dataset/codex","name":"CoDEx Small","full_name":"","num_papers_in_archive":5},{"url":"/dataset/codex-large","name":"CoDEx Large","full_name":"","num_papers_in_archive":4},{"url":"/dataset/dbp-5l","name":"DBP-5L (Greek)","full_name":"","num_papers_in_archive":4},{"url":"/dataset/inferwiki","name":"InferWiki","full_name":"","num_papers_in_archive":4},{"url":"/dataset/dbp-5l-english","name":"DBP-5L (English)","full_name":"","num_papers_in_archive":3},{"url":"/dataset/dpb-5l-french","name":"DPB-5L (French)","full_name":"","num_papers_in_archive":3},{"url":"/dataset/aristo-v4","name":"Aristo-v4","full_name":"Aristo Tuple KB Version 4","num_papers_in_archive":1},{"url":"/dataset/dbp-5l-spanish","name":"DBP-5L (Spanish)","full_name":"","num_papers_in_archive":1},{"url":"/dataset/dbp-5l-japanese","name":"DBP-5L (Japanese)","full_name":"","num_papers_in_archive":0}],"subtasks":[{"url":"/task/inductive-knowledge-graph-completion","name":"Inductive knowledge graph completion"},{"url":"/task/inductive-relation-prediction","name":"Inductive Relation Prediction"},{"url":"/task/large-language-model","name":"Large Language Model"},{"url":"/task/triple-classification","name":"Triple Classification"}],"parent_tasks":[{"url":"/task/knowledge-graphs","name":"Knowledge Graphs"}],"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":30,"of":251,"tagged_in_all":482,"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/learning-hierarchy-aware-knowledge-graph","title":"Learning Hierarchy-Aware Knowledge Graph Embeddings for Link Prediction","date":"2019-11-21","arxiv_id":"1911.09419","repositories_listed":9,"syntology":{"n":8,"n_ran":2,"n_unverified":6,"n_pointer_only":1}},{"url":"/paper/knowledge-graphs-meet-multi-modal-learning-a","title":"Knowledge Graphs Meet Multi-Modal Learning: A Comprehensive Survey","date":"2024-02-08","arxiv_id":"2402.05391","repositories_listed":6,"syntology":{"n":18,"n_ran":9,"n_unverified":9,"n_pointer_only":0}},{"url":"/paper/tucker-tensor-factorization-for-knowledge","title":"TuckER: Tensor Factorization for Knowledge Graph Completion","date":"2019-01-28","arxiv_id":"1901.09590","repositories_listed":5,"syntology":null},{"url":"/paper/multi-relational-embedding-for-knowledge","title":"Multi-Relational Embedding for Knowledge Graph Representation and Analysis","date":"2020-09-28","arxiv_id":null,"repositories_listed":4,"syntology":null},{"url":"/paper/mining-implicit-entity-preference-from-user","title":"Mining Implicit Entity Preference from User-Item Interaction Data for Knowledge Graph Completion via Adversarial Learning","date":"2020-03-28","arxiv_id":"2003.12718","repositories_listed":4,"syntology":null},{"url":"/paper/entity-context-and-relational-paths-for","title":"Relational Message Passing for Knowledge Graph Completion","date":"2020-02-17","arxiv_id":"2002.06757","repositories_listed":4,"syntology":{"n":18,"n_ran":1,"n_unverified":17,"n_pointer_only":0}},{"url":"/paper/benchmarking-the-abilities-of-large-language","title":"Benchmarking the Abilities of Large Language Models for RDF Knowledge Graph Creation and Comprehension: How Well Do LLMs Speak Turtle?","date":"2023-09-29","arxiv_id":"2309.17122","repositories_listed":3,"syntology":null},{"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/duality-induced-regularizer-for-tensor","title":"Duality-Induced Regularizer for Tensor Factorization Based Knowledge Graph Completion","date":"2020-11-11","arxiv_id":"2011.05816","repositories_listed":3,"syntology":{"n":2,"n_ran":0,"n_unverified":2,"n_pointer_only":2}},{"url":"/paper/kg-bert-bert-for-knowledge-graph-completion","title":"KG-BERT: BERT for Knowledge Graph Completion","date":"2019-09-07","arxiv_id":"1909.03193","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_unverified":1,"n_pointer_only":1}},{"url":"/paper/learning-sequence-encoders-for-temporal","title":"Learning Sequence Encoders for Temporal Knowledge Graph Completion","date":"2018-09-10","arxiv_id":"1809.03202","repositories_listed":3,"syntology":null},{"url":"/paper/mygo-discrete-modality-information-as-fine","title":"Tokenization, Fusion, and Augmentation: Towards Fine-grained Multi-modal Entity Representation","date":"2024-04-15","arxiv_id":"2404.09468","repositories_listed":2,"syntology":null},{"url":"/paper/zero-shot-logical-query-reasoning-on-any","title":"A Foundation Model for Zero-shot Logical Query Reasoning","date":"2024-04-10","arxiv_id":"2404.07198","repositories_listed":2,"syntology":null},{"url":"/paper/hyperformer-enhancing-entity-and-relation","title":"HyperFormer: Enhancing Entity and Relation Interaction for Hyper-Relational Knowledge Graph Completion","date":"2023-08-12","arxiv_id":"2308.06512","repositories_listed":2,"syntology":null},{"url":"/paper/dipping-plms-sauce-bridging-structure-and","title":"Dipping PLMs Sauce: Bridging Structure and Text for Effective Knowledge Graph Completion via Conditional Soft Prompting","date":"2023-07-04","arxiv_id":"2307.01709","repositories_listed":2,"syntology":null},{"url":"/paper/transerr-translation-based-knowledge-graph","title":"TransERR: Translation-based Knowledge Graph Embedding via Efficient Relation Rotation","date":"2023-06-26","arxiv_id":"2306.14580","repositories_listed":2,"syntology":null},{"url":"/paper/bess-balanced-entity-sampling-and-sharing-for","title":"BESS: Balanced Entity Sampling and Sharing for Large-Scale Knowledge Graph Completion","date":"2022-11-22","arxiv_id":"2211.12281","repositories_listed":2,"syntology":{"n":9,"n_ran":0,"n_unverified":9,"n_pointer_only":0}},{"url":"/paper/promptkg-a-prompt-learning-framework-for","title":"LambdaKG: A Library for Pre-trained Language Model-Based Knowledge Graph Embeddings","date":"2022-10-01","arxiv_id":"2210.00305","repositories_listed":2,"syntology":null},{"url":"/paper/simkgc-simple-contrastive-knowledge-graph","title":"SimKGC: Simple Contrastive Knowledge Graph Completion with Pre-trained Language Models","date":"2022-03-04","arxiv_id":"2203.02167","repositories_listed":2,"syntology":{"n":6,"n_ran":3,"n_unverified":3,"n_pointer_only":3}},{"url":"/paper/rethinking-graph-convolutional-networks-in","title":"Rethinking Graph Convolutional Networks in Knowledge Graph Completion","date":"2022-02-08","arxiv_id":"2202.05679","repositories_listed":2,"syntology":null},{"url":"/paper/a-probabilistic-framework-for-knowledge-graph","title":"A Probabilistic Framework for Knowledge Graph Data Augmentation","date":"2021-10-25","arxiv_id":"2110.13205","repositories_listed":2,"syntology":null},{"url":"/paper/disenkgat-knowledge-graph-embedding-with","title":"DisenKGAT: Knowledge Graph Embedding with Disentangled Graph Attention Network","date":"2021-08-22","arxiv_id":"2108.09628","repositories_listed":2,"syntology":null},{"url":"/paper/fede-embedding-knowledge-graphs-in-federated","title":"FedE: Embedding Knowledge Graphs in Federated Setting","date":"2020-10-24","arxiv_id":"2010.12882","repositories_listed":2,"syntology":null},{"url":"/paper/codex-a-comprehensive-knowledge-graph","title":"CoDEx: A Comprehensive Knowledge Graph Completion Benchmark","date":"2020-09-16","arxiv_id":"2009.07810","repositories_listed":2,"syntology":null},{"url":"/paper/multi-partition-embedding-interaction-with","title":"Multi-Partition Embedding Interaction with Block Term Format for Knowledge Graph Completion","date":"2020-06-29","arxiv_id":"2006.16365","repositories_listed":2,"syntology":null},{"url":"/paper/generative-adversarial-zero-shot-relational","title":"Generative Adversarial Zero-Shot Relational Learning for Knowledge Graphs","date":"2020-01-08","arxiv_id":"2001.02332","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_unverified":2,"n_pointer_only":3}},{"url":"/paper/temporal-knowledge-graph-embedding-model","title":"Temporal Knowledge Graph Embedding Model based on Additive Time Series Decomposition","date":"2019-11-18","arxiv_id":"1911.07893","repositories_listed":2,"syntology":null},{"url":"/paper/a-re-evaluation-of-knowledge-graph-completion","title":"A Re-evaluation of Knowledge Graph Completion Methods","date":"2019-11-10","arxiv_id":"1911.03903","repositories_listed":2,"syntology":{"n":7,"n_ran":0,"n_unverified":7,"n_pointer_only":0}},{"url":"/paper/diachronic-embedding-for-temporal-knowledge","title":"Diachronic Embedding for Temporal Knowledge Graph Completion","date":"2019-07-06","arxiv_id":"1907.03143","repositories_listed":2,"syntology":null}],"syntology_records":11,"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"}}