{"url":"/dataset/fb15k","name":"FB15k","full_name":"Freebase 15K","description_markdown":"The **FB15k** dataset contains knowledge base relation triples and textual mentions of Freebase entity pairs. It has a total of  592,213 triplets with 14,951 entities and 1,345 relationships. FB15K-237 is a variant of the original dataset where inverse relations are removed, since it was found that a large number of test triplets could be obtained by inverting triplets in the training set.\r\n\r\nSource: [https://www.microsoft.com/en-us/download/details.aspx?id=52312](https://www.microsoft.com/en-us/download/details.aspx?id=52312)\r\nImage Source: [http://papers.nips.cc/paper/5071-translating-embeddings-for-modeling-multi-relational-data.pdf](http://papers.nips.cc/paper/5071-translating-embeddings-for-modeling-multi-relational-data.pdf)","description_withheld":null,"homepage":"https://www.microsoft.com/en-us/download/details.aspx?id=52312","introduced_date":"2013-01-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":"CC BY 2.5","url":"https://creativecommons.org/licenses/by/2.5/"},"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":"Knowledge Graphs","url":"/task/knowledge-graphs","datasets_with_task":"/datasets/task/knowledge-graphs"},{"name":"Complex Query Answering","url":"/task/complex-query-answering","datasets_with_task":"/datasets/task/complex-query-answering"},{"name":"Knowledge Graph Embedding","url":"/task/knowledge-graph-embedding","datasets_with_task":"/datasets/task/knowledge-graph-embedding"}],"languages":[],"variants":[" FB15k","FB15k-237","FB15k","FB15k (filtered)"],"data_loaders":[{"repo":"https://github.com/dmlc/dgl","url":"https://docs.dgl.ai/api/python/dgl.data.html#dgl.data.FB15k237Dataset","frameworks":["pytorch","tf","mxnet"]},{"repo":"https://github.com/pykeen/pykeen","url":"https://pykeen.readthedocs.io/en/stable/api/pykeen.datasets.FB15k.html","frameworks":["pytorch"]},{"repo":"https://github.com/bi-graph/emgraph","url":"https://github.com/bi-graph/emgraph","frameworks":["tf"]}],"num_papers_in_archive":641,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/link-prediction-on-fb15k","task":"Link Prediction","dataset_variant":"FB15k","rows":23,"metrics":["MRR","Hits@1","Hits@3","Hits@10","MR","training time (s)"],"first_row_in_archive_order":{"model":"AutoKGE","paper":"/paper/autokge-searching-scoring-functions-for","metrics":{"Hits@10":"0.914","MRR":"0.861"},"code_links":[{"title":"AutoML-4Paradigm/ERAS","url":"https://github.com/AutoML-4Paradigm/ERAS"},{"title":"AutoML-4Paradigm/S2S","url":"https://github.com/AutoML-4Paradigm/S2S"},{"title":"AutoML-Research/S2S","url":"https://github.com/AutoML-Research/S2S"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/link-prediction-on-fb15k-1","task":"Link Prediction","dataset_variant":"FB15k","rows":10,"metrics":["MRR","Hits@1","Hits@3","Hits@10","MR","MRR raw","Hits@5"],"first_row_in_archive_order":{"model":"ComplEx-N3 (reciprocal)","paper":"/paper/canonical-tensor-decomposition-for-knowledge","metrics":{"Hits@10":"0.91","MRR":"0.86"},"code_links":[{"title":"facebookresearch/kbc","url":"https://github.com/facebookresearch/kbc"},{"title":"facebookresearch/ssl-relation-prediction","url":"https://github.com/facebookresearch/ssl-relation-prediction"},{"title":"twktheainur/kbc","url":"https://github.com/twktheainur/kbc"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/complex-query-answering-on-fb15k","task":"Complex Query Answering","dataset_variant":"FB15k","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.895","MRR 2i":"0.803","MRR 2p":"0.674","MRR 2u":"0.767","MRR 3i":"0.836","MRR 3p":"0.588","MRR ip":"0.740","MRR pi":"0.752","MRR up":"0.613"},"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-graphs-on-fb15k","task":"Knowledge Graphs","dataset_variant":"FB15k","rows":2,"metrics":["MRR"],"first_row_in_archive_order":{"model":"HHolE","paper":"/paper/augmenting-compositional-models-for-knowledge","metrics":{"MRR":".796"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/knowledge-graph-embedding-on-fb15k-1","task":"Knowledge Graph Embedding","dataset_variant":"FB15k","rows":1,"metrics":["MRR"],"first_row_in_archive_order":{"model":"AcrE","paper":"/paper/knowledge-graph-embedding-with-atrous","metrics":{"MRR":"0.815"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/link-prediction-on-fb15k-filtered","task":"Link Prediction","dataset_variant":"FB15k (filtered)","rows":1,"metrics":["Hits@10","MR"],"first_row_in_archive_order":{"model":"ParTransH","paper":"/paper/efficient-parallel-translating-embedding-for","metrics":{"Hits@10":"65.7","MR":"60"},"code_links":[{"title":"zdh2292390/ParTrans-X","url":"https://github.com/zdh2292390/ParTrans-X"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers_with_a_benchmark_row":[{"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/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/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/knowledge-graph-embedding-with-atrous","title":"Knowledge Graph Embedding with Atrous Convolution and Residual Learning","date":"2020-10-23","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"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/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":2,"code_links":2,"syntology":null},{"paper":"/paper/seek-segmented-embedding-of-knowledge-graphs","title":"SEEK: Segmented Embedding of Knowledge Graphs","date":"2020-05-02","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/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/representation-learning-with-ordered-relation","title":"Representation Learning with Ordered Relation Paths for Knowledge Graph Completion","date":"2019-09-26","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"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/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/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/pytorch-biggraph-a-large-scale-graph","title":"PyTorch-BigGraph: A Large-scale Graph Embedding System","date":"2019-03-28","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":2,"code_links":6,"syntology":null},{"paper":"/paper/augmenting-compositional-models-for-knowledge","title":"Augmenting Compositional Models for Knowledge Base Completion Using Gradient Representations","date":"2018-11-02","rows_on_this_dataset":3,"code_links":0,"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/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-25T09:33:49+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/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/simple-embedding-for-link-prediction-in","title":"SimplE Embedding for Link Prediction in Knowledge Graphs","date":"2018-02-13","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/knowledge-graph-embedding-with-iterative","title":"Knowledge Graph Embedding with Iterative Guidance from Soft Rules","date":"2017-11-30","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"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/efficient-parallel-translating-embedding-for","title":"Efficient Parallel Translating Embedding For Knowledge Graphs","date":"2017-03-30","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/knowledge-graph-completion-via-complex-tensor","title":"Knowledge Graph Completion via Complex Tensor Factorization","date":"2017-02-22","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/holographic-embeddings-of-knowledge-graphs","title":"Holographic Embeddings of Knowledge Graphs","date":"2015-10-16","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-25T09:33:49+00:00","samples_harvested":8,"samples_ran":0,"samples_unverified":8,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"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/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":11,"samples_harvested":102,"samples_ran":61,"samples_unverified":41,"pointer_only_for_licence":17,"papers_with_no_sample_that_ran":2,"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."}