{"url":"/sota/link-prediction-on-wn18rr","task":{"name":"Link Prediction","url":"/task/link-prediction","note":null},"dataset":{"name":"WN18RR","url":"/dataset/wn18rr"},"category":"Natural Language Processing","categories":["Graphs","Natural Language Processing"],"category_note":null,"description":"**Link Prediction** is a task in graph and network analysis where the goal is to predict missing or future connections between nodes in a network. Given a partially observed network, the goal of link prediction is to infer which links are most likely to be added or missing based on the observed connections and the structure of the network.\r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [Inductive Representation Learning on Large Graphs](https://arxiv.org/pdf/1706.02216v4.pdf) )</span>","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["Hits@10","Hits@3","Hits@1","MRR","MR"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Hits@10":null,"Hits@3":null,"Hits@1":null,"MRR":"higher","MR":null}},"counts":{"rows":75,"rows_with_code":66,"rows_with_paper_page":75,"rows_dated":75,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"MoCoKGC","metrics":{"Hits@1":"0.665","Hits@10":"0.881","Hits@3":"0.792","MRR":"0.742"},"uses_additional_data":false,"paper_date":"2024-11-12","paper":"/paper/mocokgc-momentum-contrast-entity-encoding-for","paper_url":"https://aclanthology.org/2024.emnlp-main.832/","paper_title":"MoCoKGC: Momentum Contrast Entity Encoding for Knowledge Graph Completion","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":2,"model":"KERMIT","metrics":{"Hits@1":"0.629","Hits@10":"0.832","Hits@3":"0.738","MRR":"0.700"},"uses_additional_data":false,"paper_date":"2023-09-26","paper":"/paper/kermit-knowledge-graph-completion-of-enhanced","paper_url":"https://arxiv.org/abs/2309.14770v2","paper_title":"KERMIT: Knowledge Graph Completion of Enhanced Relation Modeling with Inverse Transformation","code":"https://github.com/lirt1231/kermit","n_code_links":1,"syntology":null},{"rank_in_archive_order":3,"model":"MoCoSA","metrics":{"Hits@1":"0.624","Hits@10":"0.82","Hits@3":"0.737","MRR":"0.696"},"uses_additional_data":false,"paper_date":"2023-08-16","paper":"/paper/mocosa-momentum-contrast-for-knowledge-graph","paper_url":"https://arxiv.org/abs/2308.08204v1","paper_title":"MoCoSA: Momentum Contrast for Knowledge Graph Completion with Structure-Augmented Pre-trained Language Models","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":4,"model":"SimKGCIB(+PB+SN)","metrics":{"Hits@1":"0.588","Hits@10":"0.817","Hits@3":"0.731","MRR":"0.671"},"uses_additional_data":false,"paper_date":"2022-03-04","paper":"/paper/simkgc-simple-contrastive-knowledge-graph","paper_url":"https://arxiv.org/abs/2203.02167v1","paper_title":"SimKGC: Simple Contrastive Knowledge Graph Completion with Pre-trained Language Models","code":"https://github.com/intfloat/simkgc","n_code_links":2,"syntology":{"n_ran":3,"n_unverified":3,"n_samples":6,"n_pointer_only_licence":3}},{"rank_in_archive_order":5,"model":"C-LMKE(bert-base)","metrics":{"Hits@1":"0.523","Hits@10":"0.789","Hits@3":"0.671","MR":"79","MRR":"0.619"},"uses_additional_data":false,"paper_date":"2022-06-25","paper":"/paper/language-models-as-knowledge-embeddings","paper_url":"https://arxiv.org/abs/2206.12617v3","paper_title":"Language Models as Knowledge Embeddings","code":"https://github.com/neph0s/lmke","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":1}},{"rank_in_archive_order":6,"model":"LASS","metrics":{"Hits@10":"0.786","MR":"35"},"uses_additional_data":false,"paper_date":"2022-09-19","paper":"/paper/joint-language-semantic-and-structure","paper_url":"https://arxiv.org/abs/2209.08721v1","paper_title":"Joint Language Semantic and Structure Embedding for Knowledge Graph Completion","code":"https://github.com/pkusjh/lass","n_code_links":1,"syntology":null},{"rank_in_archive_order":7,"model":"LP-BERT","metrics":{"Hits@1":"0.343","Hits@10":"0.752","Hits@3":"0.563","MR":"92","MRR":"0.482"},"uses_additional_data":false,"paper_date":"2022-01-13","paper":"/paper/lp-bert-multi-task-pre-training-knowledge","paper_url":"https://arxiv.org/abs/2201.04843v2","paper_title":"Multi-task Pre-training Language Model for Semantic Network Completion","code":"https://github.com/763337092/LP-BERT","n_code_links":1,"syntology":null},{"rank_in_archive_order":8,"model":"KGLM","metrics":{"Hits@1":"0.330","Hits@10":"0.741","Hits@3":"0.538","MR":"40.18","MRR":"0.467"},"uses_additional_data":false,"paper_date":"2022-11-04","paper":"/paper/kglm-integrating-knowledge-graph-structure-in","paper_url":"https://arxiv.org/abs/2211.02744v2","paper_title":"KGLM: Integrating Knowledge Graph Structure in Language Models for Link Prediction","code":"https://github.com/ibpa/kglm","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":5,"n_samples":5,"n_pointer_only_licence":0}},{"rank_in_archive_order":9,"model":"StAR(Self-Adp)","metrics":{"Hits@1":"0.243","Hits@10":"0.709","Hits@3":"0.491","MR":"51","MRR":"0.401"},"uses_additional_data":false,"paper_date":"2020-04-30","paper":"/paper/semantic-triple-encoder-for-fast-open-set","paper_url":"https://arxiv.org/abs/2004.14781v2","paper_title":"Structure-Augmented Text Representation Learning for Efficient Knowledge Graph Completion","code":"https://github.com/wangbo9719/StAR_KGC","n_code_links":1,"syntology":null},{"rank_in_archive_order":10,"model":"PALT","metrics":{"Hits@10":"0.693","MR":"61"},"uses_additional_data":false,"paper_date":"2022-10-25","paper":"/paper/palt-parameter-lite-transfer-of-language","paper_url":"https://arxiv.org/abs/2210.13715v1","paper_title":"PALT: Parameter-Lite Transfer of Language Models for Knowledge Graph Completion","code":"https://github.com/yuanyehome/palt","n_code_links":1,"syntology":null},{"rank_in_archive_order":11,"model":"LERP","metrics":{"Hits@1":"0.593","Hits@10":"0.682","Hits@3":"0.634","MRR":"0.622"},"uses_additional_data":false,"paper_date":"2023-05-22","paper":"/paper/logical-entity-representation-in-knowledge","paper_url":"https://arxiv.org/abs/2305.12738v1","paper_title":"Logical Entity Representation in Knowledge-Graphs for Differentiable Rule Learning","code":"https://github.com/glaciohound/lerp","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":1,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":12,"model":"NBFNet","metrics":{"Hits@1":"0.497","Hits@10":"0.666","Hits@3":"0.573","MR":"636","MRR":"0.551"},"uses_additional_data":false,"paper_date":"2021-06-13","paper":"/paper/neural-bellman-ford-networks-a-general-graph","paper_url":"https://arxiv.org/abs/2106.06935v4","paper_title":"Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction","code":"https://github.com/DeepGraphLearning/NBFNet","n_code_links":3,"syntology":{"n_ran":2,"n_unverified":13,"n_samples":15,"n_pointer_only_licence":0}},{"rank_in_archive_order":13,"model":"DaBR","metrics":{"Hits@1":"0.450","Hits@10":"0.622","Hits@3":"0.538","MR":"899","MRR":"0.510"},"uses_additional_data":false,"paper_date":"2024-12-05","paper":"/paper/distance-adaptive-quaternion-knowledge-graph","paper_url":"https://arxiv.org/abs/2412.04076v2","paper_title":"Distance-Adaptive Quaternion Knowledge Graph Embedding with Bidirectional Rotation","code":"https://github.com/llqy123/dabr","n_code_links":1,"syntology":null},{"rank_in_archive_order":14,"model":"MLMLM","metrics":{"Hits@1":"0.4391","Hits@10":"0.611","Hits@3":"0.5418","MR":"1603","MRR":"0.5017"},"uses_additional_data":false,"paper_date":"2020-09-15","paper":"/paper/mlmlm-link-prediction-with-mean-likelihood","paper_url":"https://arxiv.org/abs/2009.07058v1","paper_title":"MLMLM: Link Prediction with Mean Likelihood Masked Language Model","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":15,"model":"GAAT","metrics":{"Hits@1":"0.424","Hits@10":"0.604","Hits@3":"0.525","MR":"1270","MRR":"0.467"},"uses_additional_data":false,"paper_date":"2019-12-31","paper":"/paper/knowledge-graph-embedding-via-graph","paper_url":"https://ieeexplore.ieee.org/abstract/document/8946600","paper_title":"Knowledge Graph Embedding via Graph Attenuated Attention Networks","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":16,"model":"Relphormer","metrics":{"Hits@1":"0.448","Hits@10":"0.591","MRR":"0.495"},"uses_additional_data":false,"paper_date":"2022-05-22","paper":"/paper/relphormer-relational-graph-transformer-for","paper_url":"https://arxiv.org/abs/2205.10852v6","paper_title":"Relphormer: Relational Graph Transformer for Knowledge Graph Representations","code":"https://github.com/zjunlp/relphormer","n_code_links":1,"syntology":{"n_ran":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":17,"model":"M3GM","metrics":{"Hits@1":"0.4537","Hits@10":"0.5902","MRR":"0.4983"},"uses_additional_data":false,"paper_date":"2018-08-27","paper":"/paper/predicting-semantic-relations-using-global","paper_url":"http://arxiv.org/abs/1808.08644v1","paper_title":"Predicting Semantic Relations using Global Graph Properties","code":"https://github.com/yuvalpinter/m3gm","n_code_links":1,"syntology":null},{"rank_in_archive_order":18,"model":"RotH","metrics":{"Hits@1":"0.449","Hits@10":"0.586","Hits@3":"0.514","MRR":".496"},"uses_additional_data":false,"paper_date":"2020-05-01","paper":"/paper/low-dimensional-hyperbolic-knowledge-graph-1","paper_url":"https://arxiv.org/abs/2005.00545v1","paper_title":"Low-Dimensional Hyperbolic Knowledge Graph Embeddings","code":"https://github.com/tensorflow/neural-structured-learning/tree/master/research/kg_hyp_emb","n_code_links":3,"syntology":{"n_ran":4,"n_unverified":7,"n_samples":11,"n_pointer_only_licence":8}},{"rank_in_archive_order":19,"model":"DRUM (T=3)","metrics":{"Hits@1":"0.425","Hits@10":"0.586","Hits@3":"0.513","MRR":"0.486"},"uses_additional_data":false,"paper_date":"2019-10-31","paper":"/paper/drum-end-to-end-differentiable-rule-mining-on","paper_url":"https://arxiv.org/abs/1911.00055v1","paper_title":"DRUM: End-To-End Differentiable Rule Mining On Knowledge Graphs","code":"https://github.com/alisadeghian/DRUM","n_code_links":1,"syntology":null},{"rank_in_archive_order":20,"model":"QuatDE","metrics":{"Hits@1":"0.438","Hits@10":"0.586","Hits@3":"0.509","MR":"1977","MRR":"0.489"},"uses_additional_data":false,"paper_date":"2021-05-19","paper":"/paper/quatde-dynamic-quaternion-embedding-for","paper_url":"https://arxiv.org/abs/2105.09002v2","paper_title":"QuatDE: Dynamic Quaternion Embedding for Knowledge Graph Completion","code":"https://github.com/hopkin-ghp/QuatDE","n_code_links":1,"syntology":null},{"rank_in_archive_order":21,"model":"HittER","metrics":{"Hits@1":"0.462","Hits@10":"0.584","Hits@3":"0.516","MRR":"0.503"},"uses_additional_data":false,"paper_date":"2020-08-28","paper":"/paper/hitter-hierarchical-transformers-for","paper_url":"https://arxiv.org/abs/2008.12813v2","paper_title":"HittER: Hierarchical Transformers for Knowledge Graph Embeddings","code":"https://github.com/zjunlp/relphormer","n_code_links":3,"syntology":{"n_ran":0,"n_unverified":7,"n_samples":7,"n_pointer_only_licence":1}},{"rank_in_archive_order":22,"model":"GC-OTE","metrics":{"Hits@1":"0.442","Hits@10":"0.583","Hits@3":"0.511","MR":"2715","MRR":"0.491"},"uses_additional_data":false,"paper_date":"2019-11-09","paper":"/paper/orthogonal-relation-transforms-with-graph","paper_url":"https://arxiv.org/abs/1911.04910v3","paper_title":"Orthogonal Relation Transforms with Graph Context Modeling for Knowledge Graph Embedding","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":23,"model":"HAKE","metrics":{"Hits@1":"0.452","Hits@10":"0.582","Hits@3":"0.516","MRR":"0.497"},"uses_additional_data":false,"paper_date":"2019-11-21","paper":"/paper/learning-hierarchy-aware-knowledge-graph","paper_url":"https://arxiv.org/abs/1911.09419v3","paper_title":"Learning Hierarchy-Aware Knowledge Graph Embeddings for Link Prediction","code":"https://github.com/MIRALab-USTC/KGE-HAKE","n_code_links":9,"syntology":{"n_ran":2,"n_unverified":6,"n_samples":8,"n_pointer_only_licence":1}},{"rank_in_archive_order":24,"model":"QuatE","metrics":{"Hits@1":"0.438","Hits@10":"0.582","Hits@3":"0.508","MR":"2314","MRR":"0.488"},"uses_additional_data":false,"paper_date":"2019-04-23","paper":"/paper/quaternion-knowledge-graph-embedding","paper_url":"https://arxiv.org/abs/1904.10281v3","paper_title":"Quaternion Knowledge Graph Embeddings","code":"https://github.com/cheungdaven/QuatE","n_code_links":1,"syntology":null},{"rank_in_archive_order":25,"model":"KBGAT","metrics":{"Hits@1":"0.361","Hits@10":"0.581","Hits@3":"0.483","MR":"1940.0","MRR":"0.44"},"uses_additional_data":false,"paper_date":"2019-06-04","paper":"/paper/learning-attention-based-embeddings-for","paper_url":"https://arxiv.org/abs/1906.01195v1","paper_title":"Learning Attention-based Embeddings for Relation Prediction in Knowledge Graphs","code":"https://github.com/deepakn97/relationPrediction","n_code_links":2,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":1}},{"rank_in_archive_order":26,"model":"ConE","metrics":{"Hits@1":"0.453","Hits@10":"0.579","Hits@3":"0.515","MRR":"0.496"},"uses_additional_data":false,"paper_date":"2021-10-28","paper":"/paper/modeling-heterogeneous-hierarchies-with","paper_url":"https://arxiv.org/abs/2110.14923v2","paper_title":"Modeling Heterogeneous Hierarchies with Relation-specific Hyperbolic Cones","code":"https://github.com/snap-stanford/ConE","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":0}},{"rank_in_archive_order":27,"model":"DensE","metrics":{"Hits@1":"0.443","Hits@10":"0.579","Hits@3":"0.508","MR":"3052","MRR":"0.491"},"uses_additional_data":false,"paper_date":"2020-08-11","paper":"/paper/dense-an-enhanced-non-abelian-group","paper_url":"https://arxiv.org/abs/2008.04548v2","paper_title":"DensE: An Enhanced Non-commutative Representation for Knowledge Graph Embedding with Adaptive Semantic Hierarchy","code":"https://github.com/anonymous-dense-submission/DensE","n_code_links":1,"syntology":null},{"rank_in_archive_order":28,"model":"LineaRE","metrics":{"Hits@1":"0.453","Hits@10":"0.578","Hits@3":"0.509","MR":"1644","MRR":"0.495"},"uses_additional_data":false,"paper_date":"2020-04-21","paper":"/paper/knowledge-graph-embedding-with-linear","paper_url":"https://arxiv.org/abs/2004.10037v2","paper_title":"LineaRE: Simple but Powerful Knowledge Graph Embedding for Link Prediction","code":"https://github.com/pengyanhui/LineaRE","n_code_links":1,"syntology":null},{"rank_in_archive_order":29,"model":"ComplEx-N3-RP","metrics":{"Hits@1":"0.443","Hits@10":"0.578","Hits@3":"0.505","MRR":"0.488"},"uses_additional_data":false,"paper_date":"2021-10-06","paper":"/paper/relation-prediction-as-an-auxiliary-training","paper_url":"https://arxiv.org/abs/2110.02834v1","paper_title":"Relation Prediction as an Auxiliary Training Objective for Improving Multi-Relational Graph Representations","code":"https://github.com/facebookresearch/ssl-relation-prediction","n_code_links":1,"syntology":null},{"rank_in_archive_order":30,"model":"SAFRAN (white box, rule based)","metrics":{"Hits@1":"0.459","Hits@10":"0.578","MRR":"0.502"},"uses_additional_data":false,"paper_date":"2021-09-16","paper":"/paper/safran-an-interpretable-rule-based-link","paper_url":"https://arxiv.org/abs/2109.08002v1","paper_title":"SAFRAN: An interpretable, rule-based link prediction method outperforming embedding models","code":"https://github.com/OpenBioLink/SAFRAN","n_code_links":1,"syntology":null},{"rank_in_archive_order":31,"model":"MEIM","metrics":{"Hits@1":"0.458","Hits@10":"0.577","Hits@3":"0.518","MRR":"0.499"},"uses_additional_data":false,"paper_date":"2022-09-30","paper":"/paper/meim-multi-partition-embedding-interaction","paper_url":"https://arxiv.org/abs/2209.15597v2","paper_title":"MEIM: Multi-partition Embedding Interaction Beyond Block Term Format for Efficient and Expressive Link Prediction","code":"https://github.com/tranhungnghiep/AnalyzingKGEmbeddings","n_code_links":4,"syntology":{"n_ran":6,"n_unverified":1,"n_samples":7,"n_pointer_only_licence":7}},{"rank_in_archive_order":32,"model":"Rot-Pro","metrics":{"Hits@1":"0.397","Hits@10":"0.577","Hits@3":"0.482","MRR":"0.457"},"uses_additional_data":false,"paper_date":"2021-10-27","paper":"/paper/rot-pro-modeling-transitivity-by-projection","paper_url":"https://arxiv.org/abs/2110.14450v1","paper_title":"Rot-Pro: Modeling Transitivity by Projection in Knowledge Graph Embedding","code":"https://github.com/tewiSong/Rot-Pro","n_code_links":2,"syntology":null},{"rank_in_archive_order":33,"model":"RESCAL-DURA","metrics":{"Hits@1":"0.455","Hits@10":"0.577","MRR":"0.498"},"uses_additional_data":false,"paper_date":"2020-11-11","paper":"/paper/duality-induced-regularizer-for-tensor","paper_url":"https://arxiv.org/abs/2011.05816v2","paper_title":"Duality-Induced Regularizer for Tensor Factorization Based Knowledge Graph Completion","code":"https://github.com/MIRALab-USTC/KGE-HAKE","n_code_links":3,"syntology":{"n_ran":0,"n_unverified":2,"n_samples":2,"n_pointer_only_licence":2}},{"rank_in_archive_order":34,"model":"GFA-NN","metrics":{"Hits@10":"0.575","MR":"3390","MRR":"0.486"},"uses_additional_data":false,"paper_date":"2021-06-01","paper":"/paper/embedding-knowledge-graphs-attentive-to","paper_url":"https://2021.ecmlpkdd.org/wp-content/uploads/2021/07/sub_1096.pdf","paper_title":"Embedding Knowledge Graphs Attentive to Positional and Centrality Qualities","code":"https://github.com/afshinsadeghi/GFA-NN","n_code_links":1,"syntology":null},{"rank_in_archive_order":35,"model":"SE-GNN (ours)","metrics":{"Hits@1":"0.446","Hits@10":"0.572","Hits@3":"0.509","MR":"3211","MRR":"0.484"},"uses_additional_data":false,"paper_date":"2021-09-24","paper":"/paper/how-does-knowledge-graph-embedding","paper_url":"https://arxiv.org/abs/2109.11800v3","paper_title":"How Does Knowledge Graph Embedding Extrapolate to Unseen Data: A Semantic Evidence View","code":"https://github.com/renli1024/se-gnn","n_code_links":1,"syntology":null},{"rank_in_archive_order":36,"model":"RotatE","metrics":{"Hits@1":"0.428","Hits@10":"0.571","Hits@3":"0.492","MR":"3340","MRR":"0.476"},"uses_additional_data":false,"paper_date":"2019-02-26","paper":"/paper/rotate-knowledge-graph-embedding-by","paper_url":"http://arxiv.org/abs/1902.10197v1","paper_title":"RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space","code":"https://github.com/pyg-team/pytorch_geometric/blob/master/torch_geometric/nn/kge/rotate.py","n_code_links":10,"syntology":{"n_ran":0,"n_unverified":5,"n_samples":5,"n_pointer_only_licence":0}},{"rank_in_archive_order":37,"model":"MetaSD","metrics":{"Hits@1":"0.447","Hits@10":"0.570","Hits@3":"0.504","MRR":"0.491"},"uses_additional_data":false,"paper_date":"2023-05-20","paper":"/paper/self-distillation-with-meta-learning-for-1","paper_url":"https://arxiv.org/abs/2305.12209v1","paper_title":"Self-Distillation with Meta Learning for Knowledge Graph Completion","code":"https://github.com/pldlgb/MetaSD","n_code_links":1,"syntology":null},{"rank_in_archive_order":38,"model":"ComplEx-N3 (reciprocal)","metrics":{"Hits@10":"0.57","MRR":"0.48"},"uses_additional_data":false,"paper_date":"2018-06-19","paper":"/paper/canonical-tensor-decomposition-for-knowledge","paper_url":"http://arxiv.org/abs/1806.07297v1","paper_title":"Canonical Tensor Decomposition for Knowledge Base Completion","code":"https://github.com/facebookresearch/kbc","n_code_links":3,"syntology":{"n_ran":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":2}},{"rank_in_archive_order":39,"model":"KGRefiner","metrics":{"Hits@10":"0.57","MR":"683","MRR":"0.448"},"uses_additional_data":false,"paper_date":"2021-06-27","paper":"/paper/kgrefiner-knowledge-graph-refinement-for","paper_url":"https://arxiv.org/abs/2106.14233v2","paper_title":"KGRefiner: Knowledge Graph Refinement for Improving Accuracy of Translational Link Prediction Methods","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":40,"model":"AutoSF","metrics":{"Hits@10":"0.567","MRR":"0.490"},"uses_additional_data":false,"paper_date":"2019-04-26","paper":"/paper/autokge-searching-scoring-functions-for","paper_url":"https://arxiv.org/abs/1904.11682v3","paper_title":"AutoSF: Searching Scoring Functions for Knowledge Graph Embedding","code":"https://github.com/AutoML-4Paradigm/ERAS","n_code_links":3,"syntology":null},{"rank_in_archive_order":41,"model":"MuRP","metrics":{"Hits@1":"0.440","Hits@10":"0.566","Hits@3":"0.495","MRR":"0.481"},"uses_additional_data":false,"paper_date":"2019-05-23","paper":"/paper/multi-relational-poincare-graph-embeddings","paper_url":"https://arxiv.org/abs/1905.09791v3","paper_title":"Multi-relational Poincaré Graph Embeddings","code":"https://github.com/ibalazevic/multirelational-poincare","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":6,"n_samples":6,"n_pointer_only_licence":0}},{"rank_in_archive_order":42,"model":"CoPER-ConvE","metrics":{"Hits@1":".4405","Hits@10":".5612","MRR":".4833"},"uses_additional_data":false,"paper_date":"2020-04-03","paper":"/paper/contextual-parameter-generation-for-knowledge","paper_url":"https://aaai.org/ojs/index.php/AAAI/article/view/5693/","paper_title":"Contextual Parameter Generation for Knowledge Graph Link Prediction","code":"https://github.com/otiliastr/coper","n_code_links":1,"syntology":null},{"rank_in_archive_order":43,"model":"MDE_adv","metrics":{"Hits@10":"0.560","MR":"3219","MRR":"0.458"},"uses_additional_data":false,"paper_date":"2019-05-25","paper":"/paper/mde-multi-distance-embeddings-for-link","paper_url":"https://arxiv.org/abs/1905.10702v8","paper_title":"MDE: Multiple Distance Embeddings for Link Prediction in Knowledge Graphs","code":"https://github.com/mlwin-de/MDE","n_code_links":2,"syntology":null},{"rank_in_archive_order":44,"model":"CapsE","metrics":{"Hits@10":"0.56","MR":"719.0","MRR":"0.415"},"uses_additional_data":false,"paper_date":"2018-08-13","paper":"/paper/a-capsule-network-based-embedding-model-for-1","paper_url":"http://arxiv.org/abs/1808.04122v3","paper_title":"A Capsule Network-based Embedding Model for Knowledge Graph Completion and Search Personalization","code":"https://github.com/daiquocnguyen/ConvKB","n_code_links":2,"syntology":{"n_ran":0,"n_unverified":7,"n_samples":7,"n_pointer_only_licence":0}},{"rank_in_archive_order":45,"model":"SAttLE","metrics":{"Hits@1":"0.454","Hits@10":"0.558","Hits@3":"0.508","MRR":"0.491"},"uses_additional_data":false,"paper_date":"2021-12-20","paper":"/paper/self-attention-presents-low-dimensional","paper_url":"https://arxiv.org/abs/2112.10644v3","paper_title":"Self-attention Presents Low-dimensional Knowledge Graph Embeddings for Link Prediction","code":"https://github.com/peyman-bi/sattle","n_code_links":1,"syntology":null},{"rank_in_archive_order":46,"model":"NePTuNe","metrics":{"Hits@1":"0.455","Hits@10":"0.557","Hits@3":"0.507","MRR":"0.491"},"uses_additional_data":false,"paper_date":"2021-04-15","paper":"/paper/neptune-neural-powered-tucker-network-for","paper_url":"https://arxiv.org/abs/2104.07824v1","paper_title":"NePTuNe: Neural Powered Tucker Network for Knowledge Graph Completion","code":"https://github.com/luffycodes/neptune","n_code_links":1,"syntology":null},{"rank_in_archive_order":47,"model":"DihEdral","metrics":{"Hits@1":"0.452","Hits@10":"0.557","Hits@3":"0.505","MRR":"0.486"},"uses_additional_data":false,"paper_date":"2019-06-03","paper":"/paper/190600687","paper_url":"https://arxiv.org/abs/1906.00687v1","paper_title":"Relation Embedding with Dihedral Group in Knowledge Graph","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":48,"model":"TransE","metrics":{"Hits@1":"0.4226","Hits@10":"0.5555","MRR":"0.4659"},"uses_additional_data":false,"paper_date":"2013-12-01","paper":"/paper/translating-embeddings-for-modeling-multi","paper_url":"http://papers.nips.cc/paper/5071-translating-embeddings-for-modeling-multi-relational-data","paper_title":"Translating Embeddings for Modeling Multi-relational Data","code":"https://github.com/pyg-team/pytorch_geometric/blob/master/torch_geometric/nn/kge/transe.py","n_code_links":8,"syntology":null},{"rank_in_archive_order":49,"model":"ComplEx (SCE w/ LS pretrained)","metrics":{"Hits@1":"0.444","Hits@10":"0.553","Hits@3":"0.496","MRR":"0.481"},"uses_additional_data":false,"paper_date":"2021-06-14","paper":"/paper/unified-interpretation-of-softmax-cross","paper_url":"https://arxiv.org/abs/2106.07250v4","paper_title":"Unified Interpretation of Softmax Cross-Entropy and Negative Sampling: With Case Study for Knowledge Graph Embedding","code":"https://github.com/kamigaito/acl2021kge","n_code_links":1,"syntology":null},{"rank_in_archive_order":50,"model":"pRotatE","metrics":{"Hits@1":"0.417","Hits@10":"0.552","Hits@3":"0.479","MR":"2923","MRR":"0.462"},"uses_additional_data":false,"paper_date":"2019-02-26","paper":"/paper/rotate-knowledge-graph-embedding-by","paper_url":"http://arxiv.org/abs/1902.10197v1","paper_title":"RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space","code":"https://github.com/pyg-team/pytorch_geometric/blob/master/torch_geometric/nn/kge/rotate.py","n_code_links":10,"syntology":{"n_ran":0,"n_unverified":5,"n_samples":5,"n_pointer_only_licence":0}},{"rank_in_archive_order":51,"model":"CP-DURA","metrics":{"Hits@1":"0.441","Hits@10":"0.552","MRR":"0.478"},"uses_additional_data":false,"paper_date":"2020-11-11","paper":"/paper/duality-induced-regularizer-for-tensor","paper_url":"https://arxiv.org/abs/2011.05816v2","paper_title":"Duality-Induced Regularizer for Tensor Factorization Based Knowledge Graph Completion","code":"https://github.com/MIRALab-USTC/KGE-HAKE","n_code_links":3,"syntology":{"n_ran":0,"n_unverified":2,"n_samples":2,"n_pointer_only_licence":2}},{"rank_in_archive_order":52,"model":"MEI","metrics":{"Hits@1":"0.444","Hits@10":"0.551","Hits@3":"0.496","MRR":"0.481"},"uses_additional_data":false,"paper_date":"2020-06-29","paper":"/paper/multi-partition-embedding-interaction-with","paper_url":"https://arxiv.org/abs/2006.16365v2","paper_title":"Multi-Partition Embedding Interaction with Block Term Format for Knowledge Graph Completion","code":"https://github.com/tranhungnghiep/AnalyzeKGE","n_code_links":2,"syntology":null},{"rank_in_archive_order":53,"model":"ProbCBR","metrics":{"Hits@1":"0.43","Hits@10":"0.55","Hits@3":"0.49","MRR":"0.48"},"uses_additional_data":false,"paper_date":"2020-10-07","paper":"/paper/probabilistic-case-based-reasoning-for-open","paper_url":"https://arxiv.org/abs/2010.03548v2","paper_title":"Probabilistic Case-based Reasoning for Open-World Knowledge Graph Completion","code":"https://github.com/ameyagodbole/Prob-CBR","n_code_links":1,"syntology":null},{"rank_in_archive_order":54,"model":"CompGCN","metrics":{"Hits@1":"0.443","Hits@10":"0.546","Hits@3":"0.494","MR":"3533","MRR":"0.479"},"uses_additional_data":false,"paper_date":"2019-11-08","paper":"/paper/composition-based-multi-relational-graph","paper_url":"https://arxiv.org/abs/1911.03082v2","paper_title":"Composition-based Multi-Relational Graph Convolutional Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/compGCN","n_code_links":4,"syntology":{"n_ran":2,"n_unverified":4,"n_samples":6,"n_pointer_only_licence":3}},{"rank_in_archive_order":55,"model":"ComplEx (SCE w/ LS)","metrics":{"Hits@1":"0.441","Hits@10":"0.546","Hits@3":"0.491","MRR":"0.477"},"uses_additional_data":false,"paper_date":"2021-06-14","paper":"/paper/unified-interpretation-of-softmax-cross","paper_url":"https://arxiv.org/abs/2106.07250v4","paper_title":"Unified Interpretation of Softmax Cross-Entropy and Negative Sampling: With Case Study for Knowledge Graph Embedding","code":"https://github.com/kamigaito/acl2021kge","n_code_links":1,"syntology":null},{"rank_in_archive_order":56,"model":"Structure-Aware Convolutional Networks","metrics":{"Hits@1":"0.43","Hits@10":"0.54","Hits@3":"0.48","MRR":"0.47"},"uses_additional_data":false,"paper_date":"2018-11-11","paper":"/paper/end-to-end-structure-aware-convolutional","paper_url":"http://arxiv.org/abs/1811.04441v2","paper_title":"End-to-end Structure-Aware Convolutional Networks for Knowledge Base Completion","code":"https://github.com/JD-AI-Research-Silicon-Valley/SACN","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":3,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":57,"model":"ConvR","metrics":{"Hits@1":"0.443","Hits@10":"0.537","Hits@3":"0.489","MRR":"0.475"},"uses_additional_data":false,"paper_date":"2019-06-01","paper":"/paper/adaptive-convolution-for-multi-relational","paper_url":"https://aclanthology.org/N19-1103","paper_title":"Adaptive Convolution for Multi-Relational Learning","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":58,"model":"GenKGC","metrics":{"Hits@1":"0.287","Hits@10":"0.535","Hits@3":"0.403"},"uses_additional_data":false,"paper_date":"2022-02-04","paper":"/paper/from-discrimination-to-generation-knowledge","paper_url":"https://arxiv.org/abs/2202.02113v7","paper_title":"From Discrimination to Generation: Knowledge Graph Completion with Generative Transformer","code":"https://github.com/zjunlp/PromptKG/tree/main/research/GenKGC","n_code_links":1,"syntology":null},{"rank_in_archive_order":59,"model":"InteractE","metrics":{"Hits@1":"0.430","Hits@10":"0.528","MR":"5202","MRR":"0.463"},"uses_additional_data":false,"paper_date":"2019-11-01","paper":"/paper/interacte-improving-convolution-based","paper_url":"https://arxiv.org/abs/1911.00219v3","paper_title":"InteractE: Improving Convolution-based Knowledge Graph Embeddings by Increasing Feature Interactions","code":"https://github.com/malllabiisc/InteractE","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":2,"n_samples":2,"n_pointer_only_licence":0}},{"rank_in_archive_order":60,"model":"TuckER","metrics":{"Hits@1":"0.443","Hits@10":"0.526","Hits@3":"0.482","MRR":"0.470"},"uses_additional_data":false,"paper_date":"2019-01-28","paper":"/paper/tucker-tensor-factorization-for-knowledge","paper_url":"https://arxiv.org/abs/1901.09590v2","paper_title":"TuckER: Tensor Factorization for Knowledge Graph Completion","code":"https://github.com/Sujit-O/pykg2vec","n_code_links":5,"syntology":null},{"rank_in_archive_order":61,"model":"ConvKB","metrics":{"Hits@10":"0.525","MR":"2554.0","MRR":"0.248"},"uses_additional_data":false,"paper_date":"2017-12-06","paper":"/paper/a-novel-embedding-model-for-knowledge-base","paper_url":"http://arxiv.org/abs/1712.02121v2","paper_title":"A Novel Embedding Model for Knowledge Base Completion Based on Convolutional Neural Network","code":"https://github.com/daiquocnguyen/ConvKB","n_code_links":2,"syntology":{"n_ran":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":0}},{"rank_in_archive_order":62,"model":"KG-BERT","metrics":{"Hits@10":"0.524","MR":"97"},"uses_additional_data":false,"paper_date":"2019-09-07","paper":"/paper/kg-bert-bert-for-knowledge-graph-completion","paper_url":"https://arxiv.org/abs/1909.03193v2","paper_title":"KG-BERT: BERT for Knowledge Graph Completion","code":"https://github.com/yao8839836/kg-bert","n_code_links":3,"syntology":{"n_ran":3,"n_unverified":1,"n_samples":4,"n_pointer_only_licence":1}},{"rank_in_archive_order":63,"model":"HypER","metrics":{"Hits@1":"0.436","Hits@10":"0.522","Hits@3":"0.477","MR":"5796","MRR":"0.465"},"uses_additional_data":false,"paper_date":"2018-08-21","paper":"/paper/hypernetwork-knowledge-graph-embeddings","paper_url":"https://arxiv.org/abs/1808.07018v5","paper_title":"Hypernetwork Knowledge Graph Embeddings","code":"https://github.com/ibalazevic/HypER","n_code_links":1,"syntology":null},{"rank_in_archive_order":64,"model":"ConvE","metrics":{"Hits@1":"0.400","Hits@10":"0.520","Hits@3":"0.440","MRR":"0.430"},"uses_additional_data":false,"paper_date":"2017-07-05","paper":"/paper/convolutional-2d-knowledge-graph-embeddings","paper_url":"http://arxiv.org/abs/1707.01476v6","paper_title":"Convolutional 2D Knowledge Graph Embeddings","code":"https://github.com/TimDettmers/ConvE","n_code_links":8,"syntology":null},{"rank_in_archive_order":65,"model":"RESCAL + Decom","metrics":{"Hits@1":"0.427","Hits@10":"0.515","Hits@3":"0.469","MRR":"0.457"},"uses_additional_data":false,"paper_date":"2019-11-11","paper":"/paper/decompressing-knowledge-graph-representations","paper_url":"https://arxiv.org/abs/1911.04053v2","paper_title":"Decompressing Knowledge Graph Representations for Link Prediction","code":"https://github.com/shawnkx/Decom","n_code_links":1,"syntology":null},{"rank_in_archive_order":66,"model":"ComplEx","metrics":{"Hits@1":"0.410","Hits@10":"0.510","MRR":"0.440"},"uses_additional_data":false,"paper_date":"2016-06-20","paper":"/paper/complex-embeddings-for-simple-link-prediction","paper_url":"http://arxiv.org/abs/1606.06357v1","paper_title":"Complex Embeddings for Simple Link Prediction","code":"https://github.com/pyg-team/pytorch_geometric/blob/2947af7733d87315a9218a0bfabbfda10b595f0e/torch_geometric/nn/kge/complex.py","n_code_links":9,"syntology":null},{"rank_in_archive_order":67,"model":"ComplEx NSCaching","metrics":{"Hits@10":"0.5089","MR":"5365","MRR":"0.4463"},"uses_additional_data":false,"paper_date":"2018-12-16","paper":"/paper/nscaching-simple-and-efficient-negative","paper_url":"http://arxiv.org/abs/1812.06410v2","paper_title":"NSCaching: Simple and Efficient Negative Sampling for Knowledge Graph Embedding","code":"https://github.com/yzhangee/NSCaching","n_code_links":6,"syntology":null},{"rank_in_archive_order":68,"model":"RotatE + GreenKGC (Ours)","metrics":{"Hits@10":"0.491","Hits@3":"0.43","MRR":"0.411"},"uses_additional_data":false,"paper_date":"2022-08-19","paper":"/paper/greenkgc-a-lightweight-knowledge-graph","paper_url":"https://arxiv.org/abs/2208.09137v2","paper_title":"GreenKGC: A Lightweight Knowledge Graph Completion Method","code":"https://github.com/yunchengwang/greenkgc","n_code_links":1,"syntology":null},{"rank_in_archive_order":69,"model":"KBGAN (TransD + ComplEx)","metrics":{"Hits@10":"0.469","MRR":"0.215"},"uses_additional_data":false,"paper_date":"2017-11-11","paper":"/paper/kbgan-adversarial-learning-for-knowledge","paper_url":"http://arxiv.org/abs/1711.04071v3","paper_title":"KBGAN: Adversarial Learning for Knowledge Graph Embeddings","code":"https://github.com/cai-lw/KBGAN","n_code_links":3,"syntology":{"n_ran":0,"n_unverified":7,"n_samples":7,"n_pointer_only_licence":0}},{"rank_in_archive_order":70,"model":"TransE + GreenKGC (Ours)","metrics":{"Hits@1":"0.3","Hits@10":"0.413","Hits@3":"0.365","MRR":"0.342"},"uses_additional_data":false,"paper_date":"2022-08-19","paper":"/paper/greenkgc-a-lightweight-knowledge-graph","paper_url":"https://arxiv.org/abs/2208.09137v2","paper_title":"GreenKGC: A Lightweight Knowledge Graph Completion Method","code":"https://github.com/yunchengwang/greenkgc","n_code_links":1,"syntology":null},{"rank_in_archive_order":71,"model":"Inverse Model","metrics":{"Hits@1":"0.35","Hits@10":"0.35","Hits@3":"0.35","MR":"13526","MRR":"0.35"},"uses_additional_data":false,"paper_date":"2017-07-05","paper":"/paper/convolutional-2d-knowledge-graph-embeddings","paper_url":"http://arxiv.org/abs/1707.01476v6","paper_title":"Convolutional 2D Knowledge Graph Embeddings","code":"https://github.com/TimDettmers/ConvE","n_code_links":8,"syntology":null},{"rank_in_archive_order":72,"model":"M-Walk","metrics":{"Hits@1":"0.414","Hits@3":"0.445","MRR":"0.437"},"uses_additional_data":false,"paper_date":"2018-02-12","paper":"/paper/m-walk-learning-to-walk-over-graphs-using","paper_url":"http://arxiv.org/abs/1802.04394v5","paper_title":"M-Walk: Learning to Walk over Graphs using Monte Carlo Tree Search","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":73,"model":"ComplEx-DURA","metrics":{"Hits@1":"0.449","MRR":"0.491"},"uses_additional_data":false,"paper_date":"2020-11-11","paper":"/paper/duality-induced-regularizer-for-tensor","paper_url":"https://arxiv.org/abs/2011.05816v2","paper_title":"Duality-Induced Regularizer for Tensor Factorization Based Knowledge Graph Completion","code":"https://github.com/MIRALab-USTC/KGE-HAKE","n_code_links":3,"syntology":{"n_ran":0,"n_unverified":2,"n_samples":2,"n_pointer_only_licence":2}},{"rank_in_archive_order":74,"model":"DisMult","metrics":{"Hits@1":"0.39","MRR":"0.43"},"uses_additional_data":false,"paper_date":"2014-12-20","paper":"/paper/embedding-entities-and-relations-for-learning","paper_url":"http://arxiv.org/abs/1412.6575v4","paper_title":"Embedding Entities and Relations for Learning and Inference in Knowledge Bases","code":"https://github.com/pyg-team/pytorch_geometric/blob/master/torch_geometric/nn/kge/distmult.py","n_code_links":10,"syntology":null},{"rank_in_archive_order":75,"model":"DistMult (after variational EM)","metrics":{"MRR":"0.455"},"uses_additional_data":false,"paper_date":"2019-07-01","paper":"/paper/augmenting-and-tuning-knowledge-graph","paper_url":"https://arxiv.org/abs/1907.01068v1","paper_title":"Augmenting and Tuning Knowledge Graph Embeddings","code":"https://github.com/mandt-lab/knowledge-graph-tuning","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":3,"n_samples":3,"n_pointer_only_licence":0}}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,795 of the 9,581 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9581,"papers_checked":6795,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":2785},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":27,"rows_with_any_sample_ran":14,"distinct_papers_with_graph_line":24,"distinct_papers_with_any_sample_ran":14,"samples_over_distinct_papers":{"n_ran":35,"n_unverified":83,"n_samples":118,"n_pointer_only_licence":30,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":35,"n_unverified":92,"n_samples":127,"n_pointer_only_licence":34,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}