{"url":"/dataset/wn18rr","name":"WN18RR","full_name":null,"description_markdown":"**WN18RR** is a link prediction dataset created from WN18, which is a subset of WordNet. WN18 consists of 18 relations and 40,943 entities. However, many text triples are obtained by inverting triples from the training set. Thus the WN18RR dataset is created to ensure that the evaluation dataset does not have inverse relation test leakage. In summary, WN18RR dataset contains 93,003 triples with 40,943 entities and 11 relation types.\r\n\r\nSource: [End-to-end Structure-Aware Convolutional Networks for Knowledge Base Completion](https://arxiv.org/abs/1811.04441)","description_withheld":null,"homepage":"https://download.microsoft.com/download/8/7/0/8700516A-AB3D-4850-B4BB-805C515AECE1/FB15K-237.2.zip","introduced_date":"2013-12-01","introduced_date_note":null,"introduced_by":{"paper":"/paper/translating-embeddings-for-modeling-multi","title":"Translating Embeddings for Modeling Multi-relational Data","first_author":"Antoine Bordes","url":null},"license":{"name":"Unknown","url":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":"Ancestor-descendant prediction","url":"/task/ancestor-descendant-prediction","datasets_with_task":"/datasets/task/ancestor-descendant-prediction"}],"languages":[],"variants":["WN18RR"],"data_loaders":[{"repo":"https://github.com/rusty1s/pytorch_geometric","url":"https://pytorch-geometric.readthedocs.io/en/latest/modules/datasets.html","frameworks":["pytorch"]},{"repo":"https://github.com/pykeen/pykeen","url":"https://pykeen.readthedocs.io/en/stable/api/pykeen.datasets.WN18RR.html","frameworks":["pytorch"]},{"repo":"https://github.com/TimDettmers/ConvE","url":"https://github.com/TimDettmers/ConvE","frameworks":["pytorch"]},{"repo":"https://github.com/bi-graph/emgraph","url":"https://github.com/bi-graph/emgraph","frameworks":["tf"]}],"num_papers_in_archive":394,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/link-prediction-on-wn18rr","task":"Link Prediction","dataset_variant":"WN18RR","rows":75,"metrics":["Hits@10","Hits@3","Hits@1","MRR","MR"],"first_row_in_archive_order":{"model":"MoCoKGC","paper":"/paper/mocokgc-momentum-contrast-entity-encoding-for","metrics":{"Hits@1":"0.665","Hits@10":"0.881","Hits@3":"0.792","MRR":"0.742"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/knowledge-graph-completion-on-wn18rr","task":"Knowledge Graph Completion","dataset_variant":"WN18RR","rows":2,"metrics":["Hits@3","Hits@1","Hits@10"],"first_row_in_archive_order":{"model":"HAKE","paper":"/paper/learning-hierarchy-aware-knowledge-graph","metrics":{"Hits@3":"0.516"},"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"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/ancestor-descendant-prediction-on-wn18rr","task":"Ancestor-descendant prediction","dataset_variant":"WN18RR","rows":1,"metrics":["mAP-0%","mAP-50%","mAP-100%"],"first_row_in_archive_order":{"model":"ConE","paper":"/paper/modeling-heterogeneous-hierarchies-with","metrics":{"mAP-0%":"0.895","mAP-100%":"0.679","mAP-50%":"0.801"},"code_links":[{"title":"snap-stanford/ConE","url":"https://github.com/snap-stanford/ConE"}]},"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/logical-entity-representation-in-knowledge","title":"Logical Entity Representation in Knowledge-Graphs for Differentiable Rule Learning","date":"2023-05-22","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":3,"samples_ran":2,"samples_unverified":1,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"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/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-24T18:15:14+00:00","samples_harvested":5,"samples_ran":0,"samples_unverified":5,"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-24T18:15:14+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/language-models-as-knowledge-embeddings","title":"Language Models as Knowledge Embeddings","date":"2022-06-25","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+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/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-24T18:15:14+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/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-24T18:15:14+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/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/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/modeling-heterogeneous-hierarchies-with","title":"Modeling Heterogeneous Hierarchies with Relation-specific Hyperbolic Cones","date":"2021-10-28","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+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":1,"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-24T18:15:14+00:00","samples_harvested":15,"samples_ran":2,"samples_unverified":13,"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":3,"code_links":3,"syntology":{"read_at":"2026-09-24T18:15:14+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/probabilistic-case-based-reasoning-for-open","title":"Probabilistic Case-based Reasoning for Open-World Knowledge Graph Completion","date":"2020-10-07","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"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-24T18:15:14+00:00","samples_harvested":7,"samples_ran":0,"samples_unverified":7,"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/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-24T18:15:14+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/contextual-parameter-generation-for-knowledge","title":"Contextual Parameter Generation for Knowledge Graph Link Prediction","date":"2020-04-03","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/knowledge-graph-embedding-via-graph","title":"Knowledge Graph Embedding via Graph Attenuated Attention Networks","date":"2019-12-31","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"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-24T18:15:14+00:00","samples_harvested":8,"samples_ran":2,"samples_unverified":6,"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/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-24T18:15:14+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-24T18:15:14+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/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-24T18:15:14+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/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-24T18:15:14+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-24T18:15:14+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/190600687","title":"Relation Embedding with Dihedral Group in Knowledge Graph","date":"2019-06-03","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"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-24T18:15:14+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/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-24T18:15:14+00:00","samples_harvested":5,"samples_ran":0,"samples_unverified":5,"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-24T18:15:14+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/predicting-semantic-relations-using-global","title":"Predicting Semantic Relations using Global Graph Properties","date":"2018-08-27","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"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/a-capsule-network-based-embedding-model-for-1","title":"A Capsule Network-based Embedding Model for Knowledge Graph Completion and Search Personalization","date":"2018-08-13","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-24T18:15:14+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/canonical-tensor-decomposition-for-knowledge","title":"Canonical Tensor Decomposition for Knowledge Base Completion","date":"2018-06-19","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":2,"samples_ran":2,"samples_unverified":0,"pointer_only_for_licence":2,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/m-walk-learning-to-walk-over-graphs-using","title":"M-Walk: Learning to Walk over Graphs using Monte Carlo Tree Search","date":"2018-02-12","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/a-novel-embedding-model-for-knowledge-base","title":"A Novel Embedding Model for Knowledge Base Completion Based on Convolutional Neural Network","date":"2017-12-06","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-24T18:15:14+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/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-24T18:15:14+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/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-24T18:15:14+00:00","papers_with_samples":24,"samples_harvested":118,"samples_ran":35,"samples_unverified":83,"pointer_only_for_licence":30,"papers_with_no_sample_that_ran":10,"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."}