{"url":"/dataset/fb15k-237","name":"FB15k-237","full_name":null,"description_markdown":"**FB15k-237** is a link prediction dataset created from FB15k. While FB15k consists of 1,345 relations, 14,951 entities, and 592,213 triples, many triples are inverses that cause leakage from the training to testing and validation splits. FB15k-237 was created by Toutanova and Chen (2015) to ensure that the testing and evaluation datasets do not have inverse relation test leakage. In summary, FB15k-237 dataset contains 310,116 triples with 14,541 entities and 237 relation types.","description_withheld":null,"homepage":"https://download.microsoft.com/download/8/7/0/8700516A-AB3D-4850-B4BB-805C515AECE1/FB15K-237.2.zip","introduced_date":"2015-07-01","introduced_date_note":null,"introduced_by":null,"license":null,"modalities":[{"name":"Graphs","url":"/datasets/modality/graphs"}],"tasks":[{"name":"Link Prediction","url":"/task/link-prediction","datasets_with_task":"/datasets/task/link-prediction"},{"name":"Knowledge Graph Completion","url":"/task/knowledge-graph-completion","datasets_with_task":"/datasets/task/knowledge-graph-completion"},{"name":"Complex Query Answering","url":"/task/complex-query-answering","datasets_with_task":"/datasets/task/complex-query-answering"}],"languages":[{"name":"English","url":"/datasets/language/english"},{"name":"Chinese","url":"/datasets/language/chinese"}],"variants":["FB15k-237"],"data_loaders":[{"repo":"https://github.com/pykeen/pykeen","url":"https://pykeen.readthedocs.io/en/latest/api/pykeen.datasets.FB15k237.html","frameworks":["pytorch"]},{"repo":"https://github.com/bi-graph/emgraph","url":"https://github.com/bi-graph/emgraph","frameworks":["tf"]}],"num_papers_in_archive":452,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/link-prediction-on-fb15k-237","task":"Link Prediction","dataset_variant":"FB15k-237","rows":75,"metrics":["Hits@1","Hits@3","Hits@10","MRR","MR","training time (s)","Hit@1","Hit@10"],"first_row_in_archive_order":{"model":"NBFNet","paper":"/paper/neural-bellman-ford-networks-a-general-graph","metrics":{"Hits@1":"0.321","Hits@10":"0.599","Hits@3":"0.454","MR":"114","MRR":"0.415"},"code_links":[{"title":"DeepGraphLearning/NBFNet","url":"https://github.com/DeepGraphLearning/NBFNet"},{"title":"fs302/EasyLink","url":"https://github.com/fs302/EasyLink/blob/main/example/ogbl_ppa_ra.py"},{"title":"fs302/EasyLink","url":"https://github.com/fs302/EasyLink"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/complex-query-answering-on-fb15k-237","task":"Complex Query Answering","dataset_variant":"FB15k-237","rows":9,"metrics":["MRR 1p","MRR 2i","MRR 2p","MRR 2u","MRR 3i","MRR 3p","MRR ip","MRR pi","MRR up","Hits@3 1p","Hits@3 2i","Hits@3 2p","Hits@3 2u","Hits@3 3i","Hits@3 3p","Hits@3 ip","Hits@3 pi","Hits@3 up"],"first_row_in_archive_order":{"model":"QTO","paper":"/paper/answering-complex-logical-queries-on","metrics":{"MRR 1p":"0.490","MRR 2i":"0.431","MRR 2p":"0.214","MRR 2u":"0.227","MRR 3i":"0.568","MRR 3p":"0.212","MRR ip":"0.280","MRR pi":"0.381","MRR up":"0.214"},"code_links":[{"title":"bys0318/qto","url":"https://github.com/bys0318/qto"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/knowledge-graph-completion-on-fb15k-237","task":"Knowledge Graph Completion","dataset_variant":"FB15k-237","rows":4,"metrics":["Hits@10","Hits@1","Hits@3","MR","MRR"],"first_row_in_archive_order":{"model":"KBGAT","paper":"/paper/learning-attention-based-embeddings-for","metrics":{"Hits@10":"62.6","Hits@3":"54"},"code_links":[{"title":"deepakn97/relationPrediction","url":"https://github.com/deepakn97/relationPrediction"},{"title":"KXY-PUBLIC/NASE","url":"https://github.com/KXY-PUBLIC/NASE"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers_with_a_benchmark_row":[{"paper":"/paper/distance-adaptive-quaternion-knowledge-graph","title":"Distance-Adaptive Quaternion Knowledge Graph Embedding with Bidirectional Rotation","date":"2024-12-05","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/mocokgc-momentum-contrast-entity-encoding-for","title":"MoCoKGC: Momentum Contrast Entity Encoding for Knowledge Graph Completion","date":"2024-11-12","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/kermit-knowledge-graph-completion-of-enhanced","title":"KERMIT: Knowledge Graph Completion of Enhanced Relation Modeling with Inverse Transformation","date":"2023-09-26","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/mocosa-momentum-contrast-for-knowledge-graph","title":"MoCoSA: Momentum Contrast for Knowledge Graph Completion with Structure-Augmented Pre-trained Language Models","date":"2023-08-16","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/self-distillation-with-meta-learning-for-1","title":"Self-Distillation with Meta Learning for Knowledge Graph Completion","date":"2023-05-20","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/adapting-neural-link-predictors-for-complex","title":"Adapting Neural Link Predictors for Data-Efficient Complex Query Answering","date":"2023-01-29","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/answering-complex-logical-queries-on","title":"Answering Complex Logical Queries on Knowledge Graphs via Query Computation Tree Optimization","date":"2022-12-19","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":7,"samples_ran":1,"samples_unverified":6,"pointer_only_for_licence":7,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/a-retrieve-and-read-framework-for-knowledge","title":"A Retrieve-and-Read Framework for Knowledge Graph Link Prediction","date":"2022-12-19","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/kglm-integrating-knowledge-graph-structure-in","title":"KGLM: Integrating Knowledge Graph Structure in Language Models for Link Prediction","date":"2022-11-04","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":5,"samples_ran":4,"samples_unverified":1,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/palt-parameter-lite-transfer-of-language","title":"PALT: Parameter-Lite Transfer of Language Models for Knowledge Graph Completion","date":"2022-10-25","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/meim-multi-partition-embedding-interaction","title":"MEIM: Multi-partition Embedding Interaction Beyond Block Term Format for Efficient and Expressive Link Prediction","date":"2022-09-30","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":7,"samples_ran":6,"samples_unverified":1,"pointer_only_for_licence":7,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/joint-language-semantic-and-structure","title":"Joint Language Semantic and Structure Embedding for Knowledge Graph Completion","date":"2022-09-19","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/greenkgc-a-lightweight-knowledge-graph","title":"GreenKGC: A Lightweight Knowledge Graph Completion Method","date":"2022-08-19","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/relphormer-relational-graph-transformer-for","title":"Relphormer: Relational Graph Transformer for Knowledge Graph Representations","date":"2022-05-22","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":3,"samples_ran":3,"samples_unverified":0,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/neural-symbolic-models-for-logical-queries-on","title":"Neural-Symbolic Models for Logical Queries on Knowledge Graphs","date":"2022-05-16","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":4,"samples_ran":1,"samples_unverified":3,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/simkgc-simple-contrastive-knowledge-graph","title":"SimKGC: Simple Contrastive Knowledge Graph Completion with Pre-trained Language Models","date":"2022-03-04","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":6,"samples_ran":3,"samples_unverified":3,"pointer_only_for_licence":3,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/r-gcn-the-r-could-stand-for-random","title":"R-GCN: The R Could Stand for Random","date":"2022-03-04","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/from-discrimination-to-generation-knowledge","title":"From Discrimination to Generation: Knowledge Graph Completion with Generative Transformer","date":"2022-02-04","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/reasoning-through-memorization-nearest","title":"Reasoning Through Memorization: Nearest Neighbor Knowledge Graph Embeddings","date":"2022-01-14","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/lp-bert-multi-task-pre-training-knowledge","title":"Multi-task Pre-training Language Model for Semantic Network Completion","date":"2022-01-13","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/self-attention-presents-low-dimensional","title":"Self-attention Presents Low-dimensional Knowledge Graph Embeddings for Link Prediction","date":"2021-12-20","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/do-pre-trained-models-benefit-knowledge-graph","title":"Do Pre-trained Models Benefit Knowledge Graph Completion? A Reliable Evaluation and a Reasonable Approach","date":"2021-11-16","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/modeling-heterogeneous-hierarchies-with","title":"Modeling Heterogeneous Hierarchies with Relation-specific Hyperbolic Cones","date":"2021-10-28","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":2,"samples_ran":2,"samples_unverified":0,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/rot-pro-modeling-transitivity-by-projection","title":"Rot-Pro: Modeling Transitivity by Projection in Knowledge Graph Embedding","date":"2021-10-27","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/relation-prediction-as-an-auxiliary-training","title":"Relation Prediction as an Auxiliary Training Objective for Improving Multi-Relational Graph Representations","date":"2021-10-06","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/how-does-knowledge-graph-embedding","title":"How Does Knowledge Graph Embedding Extrapolate to Unseen Data: A Semantic Evidence View","date":"2021-09-24","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/safran-an-interpretable-rule-based-link","title":"SAFRAN: An interpretable, rule-based link prediction method outperforming embedding models","date":"2021-09-16","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/kgrefiner-knowledge-graph-refinement-for","title":"KGRefiner: Knowledge Graph Refinement for Improving Accuracy of Translational Link Prediction Methods","date":"2021-06-27","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/unified-interpretation-of-softmax-cross","title":"Unified Interpretation of Softmax Cross-Entropy and Negative Sampling: With Case Study for Knowledge Graph Embedding","date":"2021-06-14","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":15,"samples_ran":10,"samples_unverified":5,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/embedding-knowledge-graphs-attentive-to","title":"Embedding Knowledge Graphs Attentive to Positional and Centrality Qualities","date":"2021-06-01","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/quatde-dynamic-quaternion-embedding-for","title":"QuatDE: Dynamic Quaternion Embedding for Knowledge Graph Completion","date":"2021-05-19","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/neptune-neural-powered-tucker-network-for","title":"NePTuNe: Neural Powered Tucker Network for Knowledge Graph Completion","date":"2021-04-15","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/duality-induced-regularizer-for-tensor","title":"Duality-Induced Regularizer for Tensor Factorization Based Knowledge Graph Completion","date":"2020-11-11","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":2,"samples_ran":0,"samples_unverified":2,"pointer_only_for_licence":2,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/complex-query-answering-with-neural-link-1","title":"Complex Query Answering with Neural Link Predictors","date":"2020-11-06","rows_on_this_dataset":3,"code_links":5,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":7,"samples_ran":5,"samples_unverified":2,"pointer_only_for_licence":4,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/beta-embeddings-for-multi-hop-logical","title":"Beta Embeddings for Multi-Hop Logical Reasoning in Knowledge Graphs","date":"2020-10-22","rows_on_this_dataset":1,"code_links":9,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":14,"samples_ran":9,"samples_unverified":5,"pointer_only_for_licence":1,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/mlmlm-link-prediction-with-mean-likelihood","title":"MLMLM: Link Prediction with Mean Likelihood Masked Language Model","date":"2020-09-15","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/hitter-hierarchical-transformers-for","title":"HittER: Hierarchical Transformers for Knowledge Graph Embeddings","date":"2020-08-28","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":7,"samples_ran":5,"samples_unverified":2,"pointer_only_for_licence":1,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/dense-an-enhanced-non-abelian-group","title":"DensE: An Enhanced Non-commutative Representation for Knowledge Graph Embedding with Adaptive Semantic Hierarchy","date":"2020-08-11","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/boxe-a-box-embedding-model-for-knowledge-base","title":"BoxE: A Box Embedding Model for Knowledge Base Completion","date":"2020-07-13","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/multi-partition-embedding-interaction-with","title":"Multi-Partition Embedding Interaction with Block Term Format for Knowledge Graph Completion","date":"2020-06-29","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/low-dimensional-hyperbolic-knowledge-graph-1","title":"Low-Dimensional Hyperbolic Knowledge Graph Embeddings","date":"2020-05-01","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":11,"samples_ran":4,"samples_unverified":7,"pointer_only_for_licence":8,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/semantic-triple-encoder-for-fast-open-set","title":"Structure-Augmented Text Representation Learning for Efficient Knowledge Graph Completion","date":"2020-04-30","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/knowledge-graph-embedding-with-linear","title":"LineaRE: Simple but Powerful Knowledge Graph Embedding for Link Prediction","date":"2020-04-21","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/query2box-reasoning-over-knowledge-graphs-in-1","title":"Query2box: Reasoning over Knowledge Graphs in Vector Space using Box Embeddings","date":"2020-02-14","rows_on_this_dataset":1,"code_links":9,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":41,"samples_ran":30,"samples_unverified":11,"pointer_only_for_licence":2,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/learning-hierarchy-aware-knowledge-graph","title":"Learning Hierarchy-Aware Knowledge Graph Embeddings for Link Prediction","date":"2019-11-21","rows_on_this_dataset":2,"code_links":9,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":8,"samples_ran":7,"samples_unverified":1,"pointer_only_for_licence":1,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/decompressing-knowledge-graph-representations","title":"Decompressing Knowledge Graph Representations for Link Prediction","date":"2019-11-11","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-re-evaluation-of-knowledge-graph-completion","title":"A Re-evaluation of Knowledge Graph Completion Methods","date":"2019-11-10","rows_on_this_dataset":3,"code_links":2,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":7,"samples_ran":0,"samples_unverified":7,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/orthogonal-relation-transforms-with-graph","title":"Orthogonal Relation Transforms with Graph Context Modeling for Knowledge Graph Embedding","date":"2019-11-09","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/composition-based-multi-relational-graph","title":"Composition-based Multi-Relational Graph Convolutional Networks","date":"2019-11-08","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":6,"samples_ran":2,"samples_unverified":4,"pointer_only_for_licence":3,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/interacte-improving-convolution-based","title":"InteractE: Improving Convolution-based Knowledge Graph Embeddings by Increasing Feature Interactions","date":"2019-11-01","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":2,"samples_ran":0,"samples_unverified":2,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/drum-end-to-end-differentiable-rule-mining-on","title":"DRUM: End-To-End Differentiable Rule Mining On Knowledge Graphs","date":"2019-10-31","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/using-pairwise-occurrence-information-to","title":"Using Pairwise Occurrence Information to Improve Knowledge Graph Completion on Large-Scale Datasets","date":"2019-10-25","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/kg-bert-bert-for-knowledge-graph-completion","title":"KG-BERT: BERT for Knowledge Graph Completion","date":"2019-09-07","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":4,"samples_ran":3,"samples_unverified":1,"pointer_only_for_licence":1,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/logicenn-a-neural-based-knowledge-graphs","title":"LogicENN: A Neural Based Knowledge Graphs Embedding Model with Logical Rules","date":"2019-08-20","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/augmenting-and-tuning-knowledge-graph","title":"Augmenting and Tuning Knowledge Graph Embeddings","date":"2019-07-01","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":3,"samples_ran":0,"samples_unverified":3,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/learning-attention-based-embeddings-for","title":"Learning Attention-based Embeddings for Relation Prediction in Knowledge Graphs","date":"2019-06-04","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":1,"samples_ran":1,"samples_unverified":0,"pointer_only_for_licence":1,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/adaptive-convolution-for-multi-relational","title":"Adaptive Convolution for Multi-Relational Learning","date":"2019-06-01","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/mde-multi-distance-embeddings-for-link","title":"MDE: Multiple Distance Embeddings for Link Prediction in Knowledge Graphs","date":"2019-05-25","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/multi-relational-poincare-graph-embeddings","title":"Multi-relational Poincaré Graph Embeddings","date":"2019-05-23","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":6,"samples_ran":0,"samples_unverified":6,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/autokge-searching-scoring-functions-for","title":"AutoSF: Searching Scoring Functions for Knowledge Graph Embedding","date":"2019-04-26","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/quaternion-knowledge-graph-embedding","title":"Quaternion Knowledge Graph Embeddings","date":"2019-04-23","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graphvite-a-high-performance-cpu-gpu-hybrid","title":"GraphVite: A High-Performance CPU-GPU Hybrid System for Node Embedding","date":"2019-03-02","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":7,"samples_ran":4,"samples_unverified":3,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/rotate-knowledge-graph-embedding-by","title":"RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space","date":"2019-02-26","rows_on_this_dataset":2,"code_links":10,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":5,"samples_ran":5,"samples_unverified":0,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/tucker-tensor-factorization-for-knowledge","title":"TuckER: Tensor Factorization for Knowledge Graph Completion","date":"2019-01-28","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/nscaching-simple-and-efficient-negative","title":"NSCaching: Simple and Efficient Negative Sampling for Knowledge Graph Embedding","date":"2018-12-16","rows_on_this_dataset":1,"code_links":6,"syntology":null},{"paper":"/paper/end-to-end-structure-aware-convolutional","title":"End-to-end Structure-Aware Convolutional Networks for Knowledge Base Completion","date":"2018-11-11","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":3,"samples_ran":0,"samples_unverified":3,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/hypernetwork-knowledge-graph-embeddings","title":"Hypernetwork Knowledge Graph Embeddings","date":"2018-08-21","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/embedding-logical-queries-on-knowledge-graphs","title":"Embedding Logical Queries on Knowledge Graphs","date":"2018-06-05","rows_on_this_dataset":1,"code_links":12,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":4,"samples_ran":4,"samples_unverified":0,"pointer_only_for_licence":1,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/kbgan-adversarial-learning-for-knowledge","title":"KBGAN: Adversarial Learning for Knowledge Graph Embeddings","date":"2017-11-11","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":7,"samples_ran":0,"samples_unverified":7,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/convolutional-2d-knowledge-graph-embeddings","title":"Convolutional 2D Knowledge Graph Embeddings","date":"2017-07-05","rows_on_this_dataset":2,"code_links":8,"syntology":null},{"paper":"/paper/complex-embeddings-for-simple-link-prediction","title":"Complex Embeddings for Simple Link Prediction","date":"2016-06-20","rows_on_this_dataset":1,"code_links":9,"syntology":null},{"paper":"/paper/knowledge-graph-embedding-via-dynamic-mapping","title":"Knowledge Graph Embedding via Dynamic Mapping Matrix","date":"2015-07-01","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/embedding-entities-and-relations-for-learning","title":"Embedding Entities and Relations for Learning and Inference in Knowledge Bases","date":"2014-12-20","rows_on_this_dataset":1,"code_links":10,"syntology":null},{"paper":"/paper/translating-embeddings-for-modeling-multi","title":"Translating Embeddings for Modeling Multi-relational Data","date":"2013-12-01","rows_on_this_dataset":1,"code_links":8,"syntology":null}],"syntology_totals":{"read_at":"2026-09-25T09:33:49+00:00","papers_with_samples":27,"samples_harvested":194,"samples_ran":109,"samples_unverified":85,"pointer_only_for_licence":42,"papers_with_no_sample_that_ran":7,"note":"the per-paper counts above, summed; not a rate"},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks."}