{"url":"/sota/link-prediction-on-fb15k","task":{"name":"Link Prediction","url":"/task/link-prediction","note":null},"dataset":{"name":"FB15k","url":"/dataset/fb15k"},"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":["MRR","Hits@1","Hits@3","Hits@10","MR","training time (s)"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"MRR":"higher","Hits@1":null,"Hits@3":null,"Hits@10":null,"MR":null,"training time (s)":"lower"}},"counts":{"rows":23,"rows_with_code":18,"rows_with_paper_page":22,"rows_dated":22,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"AutoKGE","metrics":{"Hits@10":"0.914","MRR":"0.861"},"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":2,"model":"DistMult (after variational EM)","metrics":{"Hits@10":"0.914","MRR":"0.841"},"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}},{"rank_in_archive_order":3,"model":"QuatE","metrics":{"Hits@1":"0.800","Hits@10":"0.900","Hits@3":"0.859","MR":"17","MRR":"0.833"},"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":4,"model":"SEEK","metrics":{"Hits@1":"0.792","Hits@10":"0.886","Hits@3":"0.841","MRR":"0.825"},"uses_additional_data":false,"paper_date":"2020-05-02","paper":"/paper/seek-segmented-embedding-of-knowledge-graphs","paper_url":"https://arxiv.org/abs/2005.00856v3","paper_title":"SEEK: Segmented Embedding of Knowledge Graphs","code":"https://github.com/Wentao-Xu/SEEK","n_code_links":1,"syntology":null},{"rank_in_archive_order":5,"model":"MEI-BTD","metrics":{"Hits@1":"0.754","Hits@10":"0.893","Hits@3":"0.843","MRR":"0.806"},"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":6,"model":"pRotatE","metrics":{"Hits@1":"0.750","Hits@10":"0.884","Hits@3":"0.829","MR":"43","MRR":"0.799"},"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":7,"model":"RotatE","metrics":{"Hits@1":"0.746","Hits@10":"0.884","Hits@3":"0.830","MR":"40","MRR":"0.797"},"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":8,"model":"HHolE","metrics":{"Hits@1":".727","Hits@10":".901","Hits@3":".848","MR":"21","MRR":".796"},"uses_additional_data":false,"paper_date":"2018-11-02","paper":"/paper/augmenting-compositional-models-for-knowledge","paper_url":"https://arxiv.org/abs/1811.01062v2","paper_title":"Augmenting Compositional Models for Knowledge Base Completion Using Gradient Representations","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":9,"model":"TuckER","metrics":{"Hits@1":"0.741","Hits@10":"0.892","Hits@3":"0.833","MRR":"0.795"},"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":10,"model":"HypER","metrics":{"Hits@1":"0.734","Hits@10":"0.885","Hits@3":"0.829","MRR":"0.790"},"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":11,"model":"ConvR","metrics":{"Hits@1":"0.720","Hits@10":"0.887","Hits@3":"0.826","MRR":"0.782"},"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":12,"model":"SimplE","metrics":{"Hits@1":"0.721","Hits@10":"0.876","Hits@3":"0.818","MR":"74","MRR":"0.779","training time (s)":"2105"},"uses_additional_data":false,"paper_date":"2019-03-02","paper":"/paper/graphvite-a-high-performance-cpu-gpu-hybrid","paper_url":"http://arxiv.org/abs/1903.00757v1","paper_title":"GraphVite: A High-Performance CPU-GPU Hybrid System for Node Embedding","code":"https://github.com/DeepGraphLearning/graphvite","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":7,"n_samples":7,"n_pointer_only_licence":0}},{"rank_in_archive_order":13,"model":"ComplEx NSCaching","metrics":{"MRR":"0.7721"},"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":14,"model":"LogicENN","metrics":{"Hits@10":"0.874","MR":"112","MRR":"0.766"},"uses_additional_data":false,"paper_date":"2019-08-20","paper":"/paper/logicenn-a-neural-based-knowledge-graphs","paper_url":"https://arxiv.org/abs/1908.07141v1","paper_title":"LogicENN: A Neural Based Knowledge Graphs Embedding Model with Logical Rules","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":15,"model":"JoBi ComplEx","metrics":{"Hits@1":"0.681","Hits@10":"0.883","Hits@3":"0.824","MRR":"0.761"},"uses_additional_data":false,"paper_date":"2019-10-25","paper":"/paper/using-pairwise-occurrence-information-to","paper_url":"https://arxiv.org/abs/1910.11583v1","paper_title":"Using Pairwise Occurrence Information to Improve Knowledge Graph Completion on Large-Scale Datasets","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":16,"model":"SimplE","metrics":{"Hits@1":"0.660","Hits@10":"0.838","Hits@3":"0.773","MRR":"0.727"},"uses_additional_data":false,"paper_date":"2018-02-13","paper":"/paper/simple-embedding-for-link-prediction-in","paper_url":"http://arxiv.org/abs/1802.04868v2","paper_title":"SimplE Embedding for Link Prediction in Knowledge Graphs","code":"https://github.com/Mehran-k/SimplE","n_code_links":2,"syntology":null},{"rank_in_archive_order":17,"model":"Relational-GCN","metrics":{"Hits@1":"0.601","Hits@10":"0.842","Hits@3":"0.760","MRR":"0.696"},"uses_additional_data":false,"paper_date":null,"paper":null,"paper_url":null,"paper_title":"","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":18,"model":"Complex","metrics":{"Hits@1":"0.599","Hits@10":"0.840","Hits@3":"0.759","MRR":"0.692"},"uses_additional_data":false,"paper_date":"2017-02-22","paper":"/paper/knowledge-graph-completion-via-complex-tensor","paper_url":"http://arxiv.org/abs/1702.06879v2","paper_title":"Knowledge Graph Completion via Complex Tensor Factorization","code":"https://github.com/Accenture/AmpliGraph","n_code_links":2,"syntology":null},{"rank_in_archive_order":19,"model":"Inverse Model","metrics":{"Hits@1":"0.658","Hits@10":"0.660","Hits@3":"0.659","MR":"2501","MRR":"0.660"},"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":20,"model":"ConvE","metrics":{"Hits@1":"0.558","Hits@10":"0.831","Hits@3":"0.723","MR":"51","MRR":"0.657"},"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":21,"model":"OPTransE","metrics":{"Hits@10":"0.899","MR":"33"},"uses_additional_data":false,"paper_date":"2019-09-26","paper":"/paper/representation-learning-with-ordered-relation","paper_url":"https://arxiv.org/abs/1909.11864v1","paper_title":"Representation Learning with Ordered Relation Paths for Knowledge Graph Completion","code":"https://github.com/Peter7Yao/OPTransE","n_code_links":1,"syntology":null},{"rank_in_archive_order":22,"model":"TransD","metrics":{"Hits@10":"0.773","MR":"91"},"uses_additional_data":false,"paper_date":"2015-07-01","paper":"/paper/knowledge-graph-embedding-via-dynamic-mapping","paper_url":"https://aclanthology.org/P15-1067","paper_title":"Knowledge Graph Embedding via Dynamic Mapping Matrix","code":"https://github.com/yangyucheng000/transX","n_code_links":1,"syntology":null},{"rank_in_archive_order":23,"model":"TransE","metrics":{"Hits@10":"0.471","MR":"125"},"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}],"since_archive":{"present":false,"note":"No Syntology-extracted rows are published in this build."},"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":4,"rows_with_any_sample_ran":0,"distinct_papers_with_graph_line":3,"distinct_papers_with_any_sample_ran":0,"samples_over_distinct_papers":{"n_ran":0,"n_unverified":15,"n_samples":15,"n_pointer_only_licence":0,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":0,"n_unverified":20,"n_samples":20,"n_pointer_only_licence":0,"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"}}}