{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"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,"slug":"is-architectural-complexity-overrated","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,"slug":"muco-kgc-multi-context-aware-knowledge-graph","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,"slug":"mucos-efficient-drug-target-prediction","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","slug":"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,"slug":"a-contextualized-bert-model-for-knowledge","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","slug":"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,"slug":"vehicle-lane-change-prediction-based-on","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,"slug":"does-pre-trained-language-model-actually","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","slug":"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","slug":"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","slug":"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,"n_ran_checked":0,"n_instrument":3,"unverified":0,"pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["ruizhang-ai/autoalign"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/logical-entity-representation-in-knowledge","slug":"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":3,"of":3,"n_ran_checked":1,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["glaciohound/lerp"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"from-wide-to-deep-dimension-lifting-network","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","slug":"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,"slug":"embedding-knowledge-graph-of-patent-metadata","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,"slug":"enhancing-patent-retrieval-using-text-and","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,"slug":"transalign-fully-automatic-and-effective","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","slug":"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,"slug":"triplere-knowledge-graph-embeddings-via","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,"slug":"compounde-knowledge-graph-embedding-with","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","slug":"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,"slug":"on-the-effectiveness-of-knowledge-graph","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","slug":"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,"slug":"spacee-knowledge-graph-embedding-by","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","slug":"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":3,"of":5,"n_ran_checked":3,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["pykeen/pykeen","pykeen/ranking-metrics-manuscript"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/simkgc-simple-contrastive-knowledge-graph","slug":"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,"n_ran_checked":0,"n_instrument":3,"unverified":3,"pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","official":{"repos":["intfloat/simkgc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"paper":null,"slug":"mining-on-alzheimer-s-diseases-related","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,"slug":"kgrefiner-knowledge-graph-refinement-for-1","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,"slug":"learning-to-borrow-relation-representation","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,"slug":"mixture-of-graphs-zero-shot-relational","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},{"paper":"/paper/qubite-qubit-embedding-for-knowledge-graph","slug":"qubite-qubit-embedding-for-knowledge-graph","title":"QubitE: Qubit Embedding for Knowledge Graph Completion","date":"2021-11-16","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"towards-robust-knowledge-graph-embedding-via","title":"Towards Robust Knowledge Graph Embedding via Multi-task Reinforcement Learning","date":"2021-11-11","arxiv_id":"2111.06103","n_code_links":0,"syntology":null},{"paper":null,"slug":"drug-re-positioning-via-text-augmented","title":"Drug Re-positioning via Text Augmented Knowledge Graph Embeddings","date":"2021-10-20","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"what-is-learned-in-knowledge-graph-embeddings","title":"What is Learned in Knowledge Graph Embeddings?","date":"2021-10-19","arxiv_id":"2110.09978","n_code_links":0,"syntology":null},{"paper":null,"slug":"why-does-negative-sampling-not-work-well","title":"Why does Negative Sampling not Work Well? Analysis of Convexity in Negative Sampling","date":"2021-09-29","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"note-solution-for-kdd-cup-2021-wikikg90m-lsc","title":"NOTE: Solution for KDD-CUP 2021 WikiKG90M-LSC","date":"2021-07-05","arxiv_id":"2107.01892","n_code_links":0,"syntology":null},{"paper":"/paper/quatde-dynamic-quaternion-embedding-for","slug":"quatde-dynamic-quaternion-embedding-for","title":"QuatDE: Dynamic Quaternion Embedding for Knowledge Graph Completion","date":"2021-05-19","arxiv_id":"2105.09002","n_code_links":1,"syntology":null},{"paper":"/paper/ranking-vs-classifying-measuring-knowledge","slug":"ranking-vs-classifying-measuring-knowledge","title":"Ranking vs. Classifying: Measuring Knowledge Base Completion Quality","date":"2021-02-02","arxiv_id":"2102.06145","n_code_links":1,"syntology":null},{"paper":null,"slug":"quantum-and-translation-embedding-for","title":"Quantum and Translation Embedding for Knowledge Graph Completion","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/drug-repurposing-for-covid-19-via-knowledge","slug":"drug-repurposing-for-covid-19-via-knowledge","title":"Drug Repurposing for COVID-19 via Knowledge Graph Completion","date":"2020-10-19","arxiv_id":"2010.09600","n_code_links":1,"syntology":null},{"paper":"/paper/mmea-entity-alignment-for-multi-modal","slug":"mmea-entity-alignment-for-multi-modal","title":"MMEA: Entity Alignment for Multi-Modal Knowledge Graphs","date":"2020-08-20","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/semantic-triple-encoder-for-fast-open-set","slug":"semantic-triple-encoder-for-fast-open-set","title":"Structure-Augmented Text Representation Learning for Efficient Knowledge Graph Completion","date":"2020-04-30","arxiv_id":"2004.14781","n_code_links":1,"syntology":null},{"paper":null,"slug":"an-evaluation-of-knowledge-graph-embeddings","title":"An Evaluation of Knowledge Graph Embeddings for Autonomous Driving Data: Experience and Practice","date":"2020-02-29","arxiv_id":"2003.00344","n_code_links":0,"syntology":null},{"paper":null,"slug":"integrating-graph-contextualized-knowledge","title":"Integrating Graph Contextualized Knowledge into Pre-trained Language Models","date":"2019-11-30","arxiv_id":"1912.00147","n_code_links":0,"syntology":null},{"paper":"/paper/orthogonal-relation-transforms-with-graph","slug":"orthogonal-relation-transforms-with-graph","title":"Orthogonal Relation Transforms with Graph Context Modeling for Knowledge Graph Embedding","date":"2019-11-09","arxiv_id":"1911.04910","n_code_links":0,"syntology":null},{"paper":null,"slug":"modeling-multi-mapping-relations-for-precise","title":"Modeling Multi-mapping Relations for Precise Cross-lingual Entity Alignment","date":"2019-11-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/semi-supervised-entity-alignment-via-joint","slug":"semi-supervised-entity-alignment-via-joint","title":"Semi-supervised Entity Alignment via Joint Knowledge Embedding Model and Cross-graph Model","date":"2019-11-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"transgcncoupling-transformation-assumptions","title":"TransGCN:Coupling Transformation Assumptions with Graph Convolutional Networks for Link Prediction","date":"2019-10-01","arxiv_id":"1910.00702","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-knowledge-graph-completion-using","title":"Toward Understanding The Effect Of Loss function On Then Performance Of Knowledge Graph Embedding","date":"2019-09-02","arxiv_id":"1909.00519","n_code_links":0,"syntology":null},{"paper":"/paper/modeling-paths-for-explainable-knowledge-base","slug":"modeling-paths-for-explainable-knowledge-base","title":"Modeling Paths for Explainable Knowledge Base Completion","date":"2019-08-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"adaptive-margin-ranking-loss-for-knowledge","title":"Adaptive Margin Ranking Loss for Knowledge Graph Embeddings via a Correntropy Objective Function","date":"2019-07-09","arxiv_id":"1907.05336","n_code_links":0,"syntology":null},{"paper":"/paper/probabilistic-logic-neural-networks-for","slug":"probabilistic-logic-neural-networks-for","title":"Probabilistic Logic Neural Networks for Reasoning","date":"2019-06-20","arxiv_id":"1906.08495","n_code_links":2,"syntology":null},{"paper":"/paper/an-open-world-extension-to-knowledge-graph","slug":"an-open-world-extension-to-knowledge-graph","title":"An Open-World Extension to Knowledge Graph Completion Models","date":"2019-06-19","arxiv_id":"1906.08382","n_code_links":1,"syntology":null},{"paper":null,"slug":"riemannian-transe-multi-relational-graph","title":"Riemannian TransE: Multi-relational Graph Embedding in Non-Euclidean Space","date":"2019-05-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"soft-marginal-transe-for-scholarly-knowledge","title":"Soft Marginal TransE for Scholarly Knowledge Graph Completion","date":"2019-04-27","arxiv_id":"1904.12211","n_code_links":0,"syntology":null},{"paper":null,"slug":"logic-rules-powered-knowledge-graph-embedding","title":"Logic Rules Powered Knowledge Graph Embedding","date":"2019-03-09","arxiv_id":"1903.03772","n_code_links":0,"syntology":null},{"paper":"/paper/end-to-end-structure-aware-convolutional","slug":"end-to-end-structure-aware-convolutional","title":"End-to-end Structure-Aware Convolutional Networks for Knowledge Base Completion","date":"2018-11-11","arxiv_id":"1811.04441","n_code_links":1,"syntology":{"ran":0,"of":3,"n_ran_checked":0,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"0 ran · 3 unverified","official":{"repos":["JD-AI-Research-Silicon-Valley/SACN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"paper":null,"slug":"knowledge-graph-embedding-with-hierarchical","title":"Knowledge Graph Embedding with Hierarchical Relation Structure","date":"2018-10-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"understanding-actors-and-evaluating-personae","title":"Understanding Actors and Evaluating Personae with Gaussian Embeddings","date":"2018-04-06","arxiv_id":"1804.04164","n_code_links":0,"syntology":null},{"paper":null,"slug":"revisiting-knowledge-base-embedding-as-tensor","title":"Revisiting Knowledge Base Embedding as Tensor Decomposition","date":"2018-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"toruse-knowledge-graph-embedding-on-a-lie","title":"TorusE: Knowledge Graph Embedding on a Lie Group","date":"2017-11-15","arxiv_id":"1711.05435","n_code_links":0,"syntology":null},{"paper":"/paper/kbgan-adversarial-learning-for-knowledge","slug":"kbgan-adversarial-learning-for-knowledge","title":"KBGAN: Adversarial Learning for Knowledge Graph Embeddings","date":"2017-11-11","arxiv_id":"1711.04071","n_code_links":3,"syntology":{"ran":7,"of":7,"n_ran_checked":7,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["cai-lw/KBGAN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"paper":null,"slug":"convolutional-neural-knowledge-graph-learning","title":"Convolutional Neural Knowledge Graph Learning","date":"2017-10-23","arxiv_id":"1710.08502","n_code_links":0,"syntology":null},{"paper":"/paper/analysis-of-the-impact-of-negative-sampling","slug":"analysis-of-the-impact-of-negative-sampling","title":"Analysis of the Impact of Negative Sampling on Link Prediction in Knowledge Graphs","date":"2017-08-22","arxiv_id":"1708.06816","n_code_links":1,"syntology":null},{"paper":"/paper/efficient-parallel-translating-embedding-for","slug":"efficient-parallel-translating-embedding-for","title":"Efficient Parallel Translating Embedding For Knowledge Graphs","date":"2017-03-30","arxiv_id":"1703.10316","n_code_links":1,"syntology":null},{"paper":"/paper/multilingual-knowledge-graph-embeddings-for","slug":"multilingual-knowledge-graph-embeddings-for","title":"Multilingual Knowledge Graph Embeddings for Cross-lingual Knowledge Alignment","date":"2016-11-12","arxiv_id":"1611.03954","n_code_links":2,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/stranse-a-novel-embedding-model-of-entities","slug":"stranse-a-novel-embedding-model-of-entities","title":"STransE: a novel embedding model of entities and relationships in knowledge bases","date":"2016-06-27","arxiv_id":"1606.08140","n_code_links":1,"syntology":null},{"paper":null,"slug":"neighborhood-mixture-model-for-knowledge-base","title":"Neighborhood Mixture Model for Knowledge Base Completion","date":"2016-06-21","arxiv_id":"1606.06461","n_code_links":0,"syntology":null},{"paper":null,"slug":"leveraging-lexical-resources-for-learning","title":"Leveraging Lexical Resources for Learning Entity Embeddings in Multi-Relational Data","date":"2016-05-18","arxiv_id":"1605.05416","n_code_links":0,"syntology":null},{"paper":null,"slug":"locally-adaptive-translation-for-knowledge","title":"Locally Adaptive Translation for Knowledge Graph Embedding","date":"2015-12-04","arxiv_id":"1512.01370","n_code_links":0,"syntology":null},{"paper":null,"slug":"knowlege-graph-embedding-by-flexible","title":"Knowlege Graph Embedding by Flexible Translation","date":"2015-05-20","arxiv_id":"1505.05253","n_code_links":0,"syntology":null},{"paper":"/paper/embedding-entities-and-relations-for-learning","slug":"embedding-entities-and-relations-for-learning","title":"Embedding Entities and Relations for Learning and Inference in Knowledge Bases","date":"2014-12-20","arxiv_id":"1412.6575","n_code_links":10,"syntology":null},{"paper":"/paper/translating-embeddings-for-modeling-multi","slug":"translating-embeddings-for-modeling-multi","title":"Translating Embeddings for Modeling Multi-relational Data","date":"2013-12-01","arxiv_id":null,"n_code_links":8,"syntology":null}],"papers_shown":73,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":73,"with_a_code_link":30,"where_syntology_ran_a_sample":6,"not_listed_spam_title":0,"listed":73,"listed_where_code_ran":6,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":4,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":4,"listed_every_run_a_failure_of_syntologys_instrument":2,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":6,"papers_where_code_ran_first_page":"/method/transe/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/transe/papers/ran/1","json":"/method/transe/papers/ran/1.json","rows":6}],"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-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=TransE","read_at":"2026-10-05T01:03:10+00:00","query":"TransE","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":null,"repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'TransE' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":[],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"5018e2dc08b2e8a4698fa211f5375ad76f60f738e6e605e517db3634840b1118","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}