Cited by 3,749Advanced Graph Neural NetworksTopic ModelingSemantic Web and Ontologies

Learning Entity and Relation Embeddings for Knowledge Graph Completion

Open access
Lin, Yankai, Liu, Zhiyuan, Sun, Maosong, Liu, Yang, Zhu, Xuan·2015·Proceedings of the AAAI Conference on Artificial Intelligence

Abstract

Knowledge graph completion aims to perform link prediction between entities. In this paper, we consider the approach of knowledge graph embeddings. Recently, models such as TransE and TransH build entity and relation embeddings by regarding a relation as translation from head entity to tail entity. We note that these models simply put both entities and relations within the same semantic space. In fact, an entity may have multiple aspects and various relations may focus on different aspects of entities, which makes a common space insufficient for modeling. In this paper, we propose TransR to build entity and relation embeddings in separate entity space and relation spaces. Afterwards, we learn embeddings by first projecting entities from entity space to corresponding relation space and then building translations between projected entities. In experiments, we evaluate our models on three tasks including link prediction, triple classification and relational fact extraction. Experimental results show significant and consistent improvements compared to state-of-the-art baselines including TransE and TransH.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1609/aaai.v29i1.9491

Cites

22 of 22 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Other variants of translational approaches such as TransE, FTransE, STransE, TransH, and TransR also have the restrictions mentioned in Proposition 2.

    “Corollary 1. Other variants of translational approaches such as TransE, FTransE, STransE, TransH [41], and TransR [22] also have the restrictions mentioned in Proposition 2.”

    From SimplE Embedding for Link Prediction in Knowledge Graphs (2018) · cites this paper as [22]

    The TransR section (p. 3) identifies TransR as a translational model, and the Cluster-based TransR section (p. 3) says it shares a limitation with TransE and TransH: one relation vector may not fit diverse entity pairs. Our copy does not identify the restrictions in the citing paper’s Proposition 2, so it cannot establish that TransR has those specific restrictions. (LLM, conf=0.76)

    Experimental — accuracy not yet measured
  • TransH introduces a hyperplane, and TransR uses a relation-specific space to handle different relations, excavating more semantic information.

    “TransH introduces a hyperplane, and TransR uses a relation-specific space to handle different relations, excavating more semantic information.”

    From A Survey on Knowledge Graph Embeddings for Link Prediction (2021) · cites this paper as [17]

  • Previous research has emphasized KG completion, optimizing models across the entire spectrum of relationships within a KG.

    “Previous research has emphasized KG completion, optimizing models across the entire spectrum of relationships within a KG58.”

    From A foundation model for clinician-centered drug repurposing (2024) · cites this paper as [58]

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 1

  1. Bordes, A.; Glorot, X.; Weston, J.; and Bengio, Y. 2014. A semantic matching energy function for learning with multirelational data. Machine Learning 94(2):233-259.

Cited by

Sorted by citations

Authors
Lin, Y., Liu, Z., Sun, M., Liu, Y., & Zhu, X.
Affiliations
  • Tsinghua University (CN)
  • Samsung (China) (CN)
Venue
Proceedings of the AAAI Conference on Artificial Intelligence
Published
2015-02-19
Volume
29
Issue
1
ISSN
  • 2159-5399 (ISSN-L)
  • 2374-3468
OpenAlex
W2184957013
Cited by
3,749
References
22
Citations by year
2026: 135 · 2025: 369 · 2024: 518 · 2023: 534 · 2022: 467 · 2021: 504 · 2020: 397 · 2019: 341 · 2018: 245 · 2017: 142 · 2016: 69 · 2015: 27 · 2012: 1
FWCI
90.92
Type
conference paper
Language
en
Open access
Locations
  • Proceedings of the AAAI Conference on Artificial Intelligence (publishedVersion)
  • AAAI Publications (The Association for the Advancement of Artificial Intelligence (AAAI)) (submittedVersion)
Funders
  • National Natural Science Foundation of China (973 Program, 61202140, 61133012)
  • Samsung
  • National Key Research and Development Program of China (2014CB340501)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Advanced Graph Neural Networks
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Physical Sciences › Computer Science › Artificial Intelligence › Semantic Web and Ontologies
Keywords
knowledge graph completion, knowledge graph embedding, entity embeddings, relation embeddings, TransR, link prediction, triple classification

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review