Cited by 3,915Advanced Graph Neural NetworksTopic ModelingRecommender Systems and Techniques

Knowledge Graph Embedding by Translating on Hyperplanes

Open access
Wang, Zhen, Zhang, Jianwen, Feng, Jianlin, Chen, Zheng·2014·Proceedings of the AAAI Conference on Artificial Intelligence

Abstract

We deal with embedding a large scale knowledge graph composed of entities and relations into a continuous vector space. TransE is a promising method proposed recently, which is very efficient while achieving state-of-the-art predictive performance. We discuss some mapping properties of relations which should be considered in embedding, such as reflexive, one-to-many, many-to-one, and many-to-many. We note that TransE does not do well in dealing with these properties. Some complex models are capable of preserving these mapping properties but sacrifice efficiency in the process. To make a good trade-off between model capacity and efficiency, in this paper we propose TransH which models a relation as a hyperplane together with a translation operation on it. In this way, we can well preserve the above mapping properties of relations with almost the same model complexity of TransE. Additionally, as a practical knowledge graph is often far from completed, how to construct negative examples to reduce false negative labels in training is very important. Utilizing the one-to-many/many-to-one mapping property of a relation, we propose a simple trick to reduce the possibility of false negative labeling. We conduct extensive experiments on link prediction, triplet classification and fact extraction on benchmark datasets like WordNet and Freebase. Experiments show TransH delivers significant improvements over TransE on predictive accuracy with comparable capability to scale up.

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.v28i1.8870

Cites

3 of 3 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?

  • 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 [15]

    The TransH section (p. 3) confirms that the paper introduces relation-specific hyperplanes and projects entity embeddings onto them to represent different roles across relations. The cited paper does not address TransR or its use of a relation-specific space, so it supports only the TransH part of the sentence. (LLM, conf=0.90)

    Experimental — accuracy not yet measured
  • Many existing translational approaches are not fully expressive.

    “We prove that many existing translational approaches (see e.g., [4, 17, 41, 26]) are not fully expressive and we identify severe restrictions on what they can represent.”

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

    The section “Relations’ Mapping Properties in Embedding” (p. 2) identifies representational restrictions of TransE for reflexive and one-to-many/many-to-one relations. This supports the general concern about limited expressiveness, but the cited paper analyzes TransE specifically; it does not establish that many translational approaches are not fully expressive. (LLM, conf=0.85)

    Experimental — accuracy not yet measured
  • TransX can infer and model the symmetry/antisymmetry pattern when g_r,1 = g_r,2, e.g. in TransH.

    “TransX can infer and model the symmetry/antisymmetry pattern when g r, 1 = g r, 2 , e.g. in TransH (Wang et al., 2014)”

    From RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space (2019) · cites this paper as Wang et al., 2014

    The TransH section (p. 3) says that head and tail entities are projected onto the same relation-specific hyperplane, consistent with the claim’s use of TransH as an example of shared projections. But our copy does not state that TransH infers or models symmetry and antisymmetry patterns, or use the notation g_r,1 = g_r,2; its discussion of relation properties concerns reflexive and one-to-many/many-to-one/many-to-many relations. (LLM, conf=0.83)

    Experimental — accuracy not yet measured
  • 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 [41]

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: 16

  1. Bollacker, K.; Evans, C.; Paritosh, P.; Sturge, T.; and Taylor, J. 2008. Freebase: A collaboratively created graph database for structuring human knowledge. In Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data , 1247-1250. ACM.
  2. Bordes, A.; Weston, J.; Collobert, R.; and Bengio, Y. 2011. Learning structured embeddings of knowledge bases. In Proceedings of the 25th AAAI Conference on Artificial Intelligence .
  3. Bordes, A.; Usunier, N.; Garcia-Duran, A.; Weston, J.; and Yakhnenko, O. 2013b. Translating embeddings for modeling multi-relational data. In Advances in Neural Information Processing Systems 26 . Curran Associates, Inc. 2787-2795.
  4. Chang, K.-W.; Yih, W.-t.; and Meek, C. 2013. Multirelational latent semantic analysis. In Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing , 1602-1612. Seattle, Washington, USA: Association for Computational Linguistics.
  5. Collobert, R., and Weston, J. 2008. A unified architecture for natural language processing: Deep neural networks with multitask learning. In Proceedings of the 25th Annual International Conference on Machine Learning (ICML 2008) , 160-167. Omnipress.
  6. Finkel, J. R.; Grenager, T.; and Manning, C. 2005. Incorporating non-local information into information extraction systems by gibbs sampling. In Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics , 363-370. Association for Computational Linguistics.
  7. Hoffmann, R.; Zhang, C.; Ling, X.; Zettlemoyer, L. S.; and Weld, D. S. 2011. Knowledge-based weak supervision for information extraction of overlapping relations. In Proceedings of the 49th Annual Meeting on Association for Computational Linguistics , 541-550. Association for Computational Linguistics.
  8. Jenatton, R.; Roux, N. L.; Bordes, A.; and Obozinski, G. R. 2012. A latent factor model for highly multi-relational data. In Advances in Neural Information Processing Systems 25 . Curran Associates, Inc. 3167-3175.
  9. Mikolov, T.; Sutskever, I.; Chen, K.; Corrado, G. S.; and Dean, J. 2013. Distributed representations of words and phrases and their compositionality. In Advances in Neural Information Processing Systems 26 . Curran Associates, Inc. 3111-3119.
  10. Mintz, M.; Bills, S.; Snow, R.; and Jurafsky, D. 2009. Distant supervision for relation extraction without labeled data. In Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2-Volume 2 , 1003-1011. Association for Computational Linguistics.
  11. Nickel, M.; Tresp, V.; and Kriegel, H.-P. 2011. A threeway model for collective learning on multi-relational data. In Proceedings of the 28th International Conference on Machine Learning (ICML-11) , ICML '11, 809-816. New York, NY, USA: ACM.
  12. Riedel, S.; Yao, L.; and McCallum, A. 2010. Modeling relations and their mentions without labeled text. In Machine Learning and Knowledge Discovery in Databases . Springer. 148-163.
  13. Socher, R.; Chen, D.; Manning, C. D.; and Ng, A. 2013. Reasoning with neural tensor networks for knowledge base completion. In Advances in Neural Information Processing Systems 26 . Curran Associates, Inc. 926-934.
  14. Surdeanu, M.; Tibshirani, J.; Nallapati, R.; and Manning, C. D. 2012. Multi-instance multi-label learning for relation extraction. In Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning , 455-465. Association for Computational Linguistics.
  15. Sutskever, I.; Tenenbaum, J. B.; and Salakhutdinov, R. 2009. Modelling relational data using bayesian clustered tensor factorization. In Advances in Neural Information Processing Systems 22 . Curran Associates, Inc. 1821-1828.
  16. Weston, J.; Bordes, A.; Yakhnenko, O.; and Usunier, N. 2013. Connecting language and knowledge bases with embedding models for relation extraction. In Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing , 1366-1371. Seattle, Washington, USA: Association for Computational Linguistics.

Cited by

Sorted by citations

Authors
Wang, Z., Zhang, J., Feng, J., & Chen, Z.
Affiliations
  • Sun Yat-sen University (CN)
  • Microsoft Research Asia (China) (CN)
  • Microsoft (United States) (US)
Venue
Proceedings of the AAAI Conference on Artificial Intelligence
Published
2014-06-21
Volume
28
Issue
1
ISSN
  • 2159-5399 (ISSN-L)
  • 2374-3468
OpenAlex
W2283196293
Cited by
3,915
References
3
Citations by year
2026: 174 · 2025: 421 · 2024: 550 · 2023: 616 · 2022: 491 · 2021: 504 · 2020: 376 · 2019: 331 · 2018: 215 · 2017: 126 · 2016: 72 · 2015: 36 · 2014: 2 · 2012: 1
FWCI
46.33
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
Microsoft Research
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, TransH, TransE, reflexive relations, link prediction, fact extraction, model efficiency

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