Cargando…
A type-augmented knowledge graph embedding framework for knowledge graph completion
Knowledge graphs (KGs) are of great importance to many artificial intelligence applications, but they usually suffer from the incomplete problem. Knowledge graph embedding (KGE), which aims to represent entities and relations in low-dimensional continuous vector spaces, has been proved to be a promi...
Autores principales: | , , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10390491/ https://www.ncbi.nlm.nih.gov/pubmed/37524764 http://dx.doi.org/10.1038/s41598-023-38857-5 |
_version_ | 1785082486254993408 |
---|---|
author | He, Peng Zhou, Gang Yao, Yao Wang, Zhe Yang, Hao |
author_facet | He, Peng Zhou, Gang Yao, Yao Wang, Zhe Yang, Hao |
author_sort | He, Peng |
collection | PubMed |
description | Knowledge graphs (KGs) are of great importance to many artificial intelligence applications, but they usually suffer from the incomplete problem. Knowledge graph embedding (KGE), which aims to represent entities and relations in low-dimensional continuous vector spaces, has been proved to be a promising approach for KG completion. Traditional KGE methods only concentrate on structured triples, while paying less attention to the type information of entities. In fact, incorporating entity types into embedding learning could further improve the performance of KG completion. To this end, we propose a universal Type-augmented Knowledge graph Embedding framework (TaKE) which could utilize type features to enhance any traditional KGE models. TaKE automatically captures type features under no explicit type information supervision. And by learning different type representations of each entity, TaKE could distinguish the diversity of types specific to distinct relations. We also design a new type-constrained negative sampling strategy to construct more effective negative samples for the training process. Extensive experiments on four datasets from three real-world KGs (Freebase, WordNet and YAGO) demonstrate the merits of our proposed framework. In particular, combining TaKE with the recent tensor factorization KGE model SimplE can achieve state-of-the-art performance on the KG completion task. |
format | Online Article Text |
id | pubmed-10390491 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2023 |
publisher | Nature Publishing Group UK |
record_format | MEDLINE/PubMed |
spelling | pubmed-103904912023-08-02 A type-augmented knowledge graph embedding framework for knowledge graph completion He, Peng Zhou, Gang Yao, Yao Wang, Zhe Yang, Hao Sci Rep Article Knowledge graphs (KGs) are of great importance to many artificial intelligence applications, but they usually suffer from the incomplete problem. Knowledge graph embedding (KGE), which aims to represent entities and relations in low-dimensional continuous vector spaces, has been proved to be a promising approach for KG completion. Traditional KGE methods only concentrate on structured triples, while paying less attention to the type information of entities. In fact, incorporating entity types into embedding learning could further improve the performance of KG completion. To this end, we propose a universal Type-augmented Knowledge graph Embedding framework (TaKE) which could utilize type features to enhance any traditional KGE models. TaKE automatically captures type features under no explicit type information supervision. And by learning different type representations of each entity, TaKE could distinguish the diversity of types specific to distinct relations. We also design a new type-constrained negative sampling strategy to construct more effective negative samples for the training process. Extensive experiments on four datasets from three real-world KGs (Freebase, WordNet and YAGO) demonstrate the merits of our proposed framework. In particular, combining TaKE with the recent tensor factorization KGE model SimplE can achieve state-of-the-art performance on the KG completion task. Nature Publishing Group UK 2023-07-31 /pmc/articles/PMC10390491/ /pubmed/37524764 http://dx.doi.org/10.1038/s41598-023-38857-5 Text en © The Author(s) 2023 https://creativecommons.org/licenses/by/4.0/Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/ (https://creativecommons.org/licenses/by/4.0/) . |
spellingShingle | Article He, Peng Zhou, Gang Yao, Yao Wang, Zhe Yang, Hao A type-augmented knowledge graph embedding framework for knowledge graph completion |
title | A type-augmented knowledge graph embedding framework for knowledge graph completion |
title_full | A type-augmented knowledge graph embedding framework for knowledge graph completion |
title_fullStr | A type-augmented knowledge graph embedding framework for knowledge graph completion |
title_full_unstemmed | A type-augmented knowledge graph embedding framework for knowledge graph completion |
title_short | A type-augmented knowledge graph embedding framework for knowledge graph completion |
title_sort | type-augmented knowledge graph embedding framework for knowledge graph completion |
topic | Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10390491/ https://www.ncbi.nlm.nih.gov/pubmed/37524764 http://dx.doi.org/10.1038/s41598-023-38857-5 |
work_keys_str_mv | AT hepeng atypeaugmentedknowledgegraphembeddingframeworkforknowledgegraphcompletion AT zhougang atypeaugmentedknowledgegraphembeddingframeworkforknowledgegraphcompletion AT yaoyao atypeaugmentedknowledgegraphembeddingframeworkforknowledgegraphcompletion AT wangzhe atypeaugmentedknowledgegraphembeddingframeworkforknowledgegraphcompletion AT yanghao atypeaugmentedknowledgegraphembeddingframeworkforknowledgegraphcompletion AT hepeng typeaugmentedknowledgegraphembeddingframeworkforknowledgegraphcompletion AT zhougang typeaugmentedknowledgegraphembeddingframeworkforknowledgegraphcompletion AT yaoyao typeaugmentedknowledgegraphembeddingframeworkforknowledgegraphcompletion AT wangzhe typeaugmentedknowledgegraphembeddingframeworkforknowledgegraphcompletion AT yanghao typeaugmentedknowledgegraphembeddingframeworkforknowledgegraphcompletion |