Cited by 75Advanced Graph Neural NetworksTopic ModelingRecommender Systems and Techniques

TransMS: Knowledge Graph Embedding for Complex Relations by Multidirectional Semantics

Yang, Shihui, Tian, Jidong, Zhang, Honglun, Yan, Junchi, He, Hao, Jin, Yaohui·2019·Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence

Abstract

Knowledge graph embedding, which projects the symbolic relations and entities onto low-dimension continuous spaces, is essential to knowledge graph completion. Recently, translation-based embedding models (e.g. TransE) have aroused increasing attention for their simplicity and effectiveness. These models attempt to translate semantics from head entities to tail entities with the relations and infer richer facts outside the knowledge graph. In this paper, we propose a novel knowledge graph embedding method named TransMS, which translates and transmits multidirectional semantics: i) the semantics of head/tail entities and relations to tail/head entities with nonlinear functions and ii) the semantics from entities to relations with linear bias vectors. Our model has merely one additional parameter α than TransE for each triplet, which results in its better scalability in large-scale knowledge graph. Experiments show that TransMS achieves substantial improvements against state-of-the-art baselines, especially the Hit@10s of head entity prediction for N-1 relations and tail entity prediction for 1-N relations improved by about 27.1% and 24.8% on FB15K database respectively.

Integrity signals

Registry

Crossref · 10.24963/ijcai.2019/268

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • TransMS considers the semantics between the head entity and the relation as well as between the relation and the tail entity, which previous models do not do.

    “In this way, it considers the semantics between the head entity and the relation as well as the semantics between the relation and the tail entity, which is not done in previous models.”

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

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Yang, S., Tian, J., Zhang, H., Yan, J., He, H., & Jin, Y.
Affiliations
Shanghai Jiao Tong University (CN)
Venue
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence
Published
2019-08
Pages
1935-1942
OpenAlex
W2966459188
Cited by
75
References
1
Citations by year
2026: 1 · 2025: 5 · 2024: 10 · 2023: 14 · 2022: 15 · 2021: 16 · 2020: 14
FWCI
4.21
Type
conference paper
Language
en
Open access
closed
Locations
International Joint Conference on Artificial Intelligence (publishedVersion)
Funders
  • Science and Technology Commission of Shanghai Municipality (18DZ1112300)
  • National Key Research and Development Program of China (2018YFC0830400, 2016YFB1001003)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Advanced Graph Neural Networks
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
Keywords
knowledge graph embedding, TransE, complex relations, knowledge graph completion, large-scale knowledge graphs

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