{"url":"/method/transe","slug":"transe","name":"TransE","full_name":"TransE","full_name_withheld":false,"description_markdown":"**TransE** is an energy-based model that produces knowledge base embeddings. It models relationships by interpreting them as translations operating on the low-dimensional embeddings of the entities. Relationships are represented as translations in the embedding space: if $\\left(h, \\mathcal{l}, t\\right)$ holds, the embedding of the tail entity $t$ should be close to the embedding of the head entity $h$ plus some vector that depends on the relationship $\\mathcal{l}$.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Translating Embeddings for Modeling Multi-relational Data","paper":"/paper/translating-embeddings-for-modeling-multi","first_author":"Antoine Bordes","n_authors":5,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/translating-embeddings-for-modeling-multi"},"source":{"url":"http://papers.nips.cc/paper/5071-translating-embeddings-for-modeling-multi-relational-data","title":"Translating Embeddings for Modeling Multi-relational Data","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Graphs","area_id":"graphs","collection":"Graph Embeddings","url":"/methods/category/graph-embeddings","pwc_aliases":[]}],"n_papers_tagged":73,"archive_num_papers":73,"papers_newest_first":[{"paper":null,"title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE","date":"2025-05-25","arxiv_id":"2505.18971","n_code_links":0,"syntology":null},{"paper":null,"title":"MuCo-KGC: Multi-Context-Aware Knowledge Graph Completion","date":"2025-03-05","arxiv_id":"2503.03091","n_code_links":0,"syntology":null},{"paper":null,"title":"MuCoS: Efficient Drug-Target Prediction through Multi-Context-Aware Sampling","date":"2025-02-25","arxiv_id":"2502.17784","n_code_links":0,"syntology":null},{"paper":"/paper/sparsetransx-efficient-training-of","title":"SparseTransX: Efficient Training of Translation-Based Knowledge Graph Embeddings Using Sparse Matrix Operations","date":"2025-02-24","arxiv_id":"2502.16949","n_code_links":2,"syntology":null},{"paper":null,"title":"A Contextualized BERT model for Knowledge Graph Completion","date":"2024-12-15","arxiv_id":"2412.11016","n_code_links":0,"syntology":null},{"paper":"/paper/unified-interpretation-of-smoothing-methods","title":"Unified Interpretation of Smoothing Methods for Negative Sampling Loss Functions in Knowledge Graph Embedding","date":"2024-07-05","arxiv_id":"2407.04251","n_code_links":1,"syntology":null},{"paper":null,"title":"Vehicle Lane Change Prediction based on Knowledge Graph Embeddings and Bayesian Inference","date":"2023-12-11","arxiv_id":"2312.06336","n_code_links":0,"syntology":null},{"paper":null,"title":"Does Pre-trained Language Model Actually Infer Unseen Links in Knowledge Graph Completion?","date":"2023-11-15","arxiv_id":"2311.09109","n_code_links":0,"syntology":null},{"paper":"/paper/model-based-subsampling-for-knowledge-graph","title":"Model-based Subsampling for Knowledge Graph Completion","date":"2023-09-17","arxiv_id":"2309.09296","n_code_links":1,"syntology":null},{"paper":"/paper/dblplink-an-entity-linker-for-the-dblp","title":"DBLPLink: An Entity Linker for the DBLP Scholarly Knowledge Graph","date":"2023-09-14","arxiv_id":"2309.07545","n_code_links":1,"syntology":null},{"paper":"/paper/autoalign-fully-automatic-and-effective","title":"AutoAlign: Fully Automatic and Effective Knowledge Graph Alignment enabled by Large Language Models","date":"2023-07-18","arxiv_id":"2307.11772","n_code_links":1,"syntology":{"ran":3,"of":3,"unverified":0,"pointer_only":3}},{"paper":"/paper/logical-entity-representation-in-knowledge","title":"Logical Entity Representation in Knowledge-Graphs for Differentiable Rule Learning","date":"2023-05-22","arxiv_id":"2305.12738","n_code_links":1,"syntology":{"ran":2,"of":3,"unverified":1,"pointer_only":0}},{"paper":null,"title":"From Wide to Deep: Dimension Lifting Network for Parameter-efficient Knowledge Graph Embedding","date":"2023-03-22","arxiv_id":"2303.12816","n_code_links":0,"syntology":null},{"paper":"/paper/diversity-matters-robustness-of-bias","title":"Diversity matters: Robustness of bias measurements in Wikidata","date":"2023-02-27","arxiv_id":"2302.14027","n_code_links":1,"syntology":null},{"paper":null,"title":"Embedding Knowledge Graph of Patent Metadata to Measure Knowledge Proximity","date":"2022-11-03","arxiv_id":"2211.01768","n_code_links":0,"syntology":null},{"paper":null,"title":"Enhancing Patent Retrieval using Text and Knowledge Graph Embeddings: A Technical Note","date":"2022-11-03","arxiv_id":"2211.01976","n_code_links":0,"syntology":null},{"paper":null,"title":"TransAlign: Fully Automatic and Effective Entity Alignment for Knowledge Graphs","date":"2022-10-16","arxiv_id":"2210.08540","n_code_links":0,"syntology":null},{"paper":"/paper/walk-and-relate-a-random-walk-based-algorithm","title":"Walk-and-Relate: A Random-Walk-based Algorithm for Representation Learning on Sparse Knowledge Graphs","date":"2022-09-19","arxiv_id":"2209.08769","n_code_links":1,"syntology":null},{"paper":null,"title":"TripleRE: Knowledge Graph Embeddings via Tripled Relation Vectors","date":"2022-09-17","arxiv_id":"2209.08271","n_code_links":0,"syntology":null},{"paper":null,"title":"CompoundE: Knowledge Graph Embedding with Translation, Rotation and Scaling Compound Operations","date":"2022-07-12","arxiv_id":"2207.05324","n_code_links":0,"syntology":null},{"paper":"/paper/comprehensive-analysis-of-negative-sampling","title":"Comprehensive Analysis of Negative Sampling in Knowledge Graph Representation Learning","date":"2022-06-21","arxiv_id":"2206.10140","n_code_links":1,"syntology":null},{"paper":null,"title":"On the Effectiveness of Knowledge Graph Embeddings: a Rule Mining Approach","date":"2022-06-02","arxiv_id":"2206.00983","n_code_links":0,"syntology":null},{"paper":"/paper/learning-to-borrow-relation-representation-1","title":"Learning to Borrow -- Relation Representation for Without-Mention Entity-Pairs for Knowledge Graph Completion","date":"2022-04-27","arxiv_id":"2204.13097","n_code_links":1,"syntology":null},{"paper":null,"title":"SpaceE: Knowledge Graph Embedding by Relational Linear Transformation in the Entity Space","date":"2022-04-21","arxiv_id":"2204.10245","n_code_links":0,"syntology":null},{"paper":"/paper/a-unified-framework-for-rank-based-evaluation","title":"A Unified Framework for Rank-based Evaluation Metrics for Link Prediction in Knowledge Graphs","date":"2022-03-14","arxiv_id":"2203.07544","n_code_links":2,"syntology":{"ran":0,"of":5,"unverified":5,"pointer_only":0}},{"paper":"/paper/simkgc-simple-contrastive-knowledge-graph","title":"SimKGC: Simple Contrastive Knowledge Graph Completion with Pre-trained Language Models","date":"2022-03-04","arxiv_id":"2203.02167","n_code_links":2,"syntology":{"ran":3,"of":6,"unverified":3,"pointer_only":3}},{"paper":null,"title":"Mining On Alzheimer's Diseases Related Knowledge Graph to Identity Potential AD-related Semantic Triples for Drug Repurposing","date":"2022-02-17","arxiv_id":"2202.08712","n_code_links":0,"syntology":null},{"paper":null,"title":"KGRefiner: Knowledge Graph Refinement for Improving Accuracy of Translational Link Prediction Methods","date":"2022-01-16","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"title":"Learning to Borrow– Relation Representation for Without-Mention Entity-Pairs for Knowledge Graph Completion","date":"2022-01-16","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"title":"Mixture-of-Graphs: Zero-shot Relational Learning for Knowledge Graph by Fusing Ontology and Textual Experts","date":"2021-11-16","arxiv_id":null,"n_code_links":0,"syntology":null}],"papers_shown":30,"tasks":[{"task":"/task/knowledge-graphs","name":"Knowledge Graphs","papers":40},{"task":"/task/graph-embedding","name":"Graph Embedding","papers":31},{"task":"/task/link-prediction","name":"Link Prediction","papers":28},{"task":"/task/knowledge-graph-embedding","name":"Knowledge Graph Embedding","papers":27},{"task":"/task/knowledge-graph-completion","name":"Knowledge Graph Completion","papers":20},{"task":"/task/translation","name":"Translation","papers":14},{"task":"/task/knowledge-graph-embeddings","name":"Knowledge Graph Embeddings","papers":13},{"task":null,"name":"Relation","papers":12},{"task":"/task/entity-embeddings","name":"Entity Embeddings","papers":9},{"task":"/task/knowledge-base-completion","name":"Knowledge Base Completion","papers":9},{"task":null,"name":"Triplet","papers":7},{"task":"/task/entity-alignment","name":"Entity Alignment","papers":6},{"task":"/task/prediction","name":"Prediction","papers":6},{"task":"/task/representation-learning","name":"Representation Learning","papers":6},{"task":"/task/model","name":"model","papers":4},{"task":"/task/question-answering","name":"Question Answering","papers":3},{"task":"/task/sentence","name":"Sentence","papers":3},{"task":"/task/triple-classification","name":"Triple Classification","papers":3},{"task":"/task/decoder","name":"Decoder","papers":2},{"task":null,"name":"GPU","papers":2}],"tasks_shown":20,"n_tasks":62,"usage_by_year":[{"year":"2013","papers":1},{"year":"2014","papers":1},{"year":"2015","papers":2},{"year":"2016","papers":4},{"year":"2017","papers":5},{"year":"2018","papers":4},{"year":"2019","papers":13},{"year":"2020","papers":4},{"year":"2021","papers":10},{"year":"2022","papers":15},{"year":"2023","papers":8},{"year":"2024","papers":2},{"year":"2025","papers":4}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/transe"},"syntology_read_at":"2026-09-24T18:15:14+00:00"}