TY - GEN
T1 - Representation learning with complete semantic description of knowledge graphs
AU - Chen, Wenrui
AU - Luo, Chuyao
AU - Wang, Shaokai
AU - Ye, Yunming
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/11/14
Y1 - 2017/11/14
N2 - Representation Learning (RL) of knowledge graphs aims to project both entities and relations into a continuous low dimensional space. There exits two kinds of representation methods for entities in Knowledge Graphs (KGs), including structure-based representation and description-based representation. Most methods represent entities with fact triples of KGs through translating embedding models, which can't integrate the rich information in entities descriptions with triple structure information. In this paper, we propose a novel RL method named as Representation Learning with Complete semantic Description of Knowledge Graphs (RLCD), which can exploit all semantic information of entity descriptions and fact triples of KGs, to enrich the semantic representations of KGs. More specifically, we explore Doc2Vec encoder model to encode all semantic information of entity descriptions without losing the relevance in the context of entities descriptions, and further learn knowledge representations from triples with entity descriptions. The experiment results show that RLCD gets better performance that state-of-the-art method DKRL, in terms of mean rank value and HITS. Moreover, RLCD is much faster than DKRL.
AB - Representation Learning (RL) of knowledge graphs aims to project both entities and relations into a continuous low dimensional space. There exits two kinds of representation methods for entities in Knowledge Graphs (KGs), including structure-based representation and description-based representation. Most methods represent entities with fact triples of KGs through translating embedding models, which can't integrate the rich information in entities descriptions with triple structure information. In this paper, we propose a novel RL method named as Representation Learning with Complete semantic Description of Knowledge Graphs (RLCD), which can exploit all semantic information of entity descriptions and fact triples of KGs, to enrich the semantic representations of KGs. More specifically, we explore Doc2Vec encoder model to encode all semantic information of entity descriptions without losing the relevance in the context of entities descriptions, and further learn knowledge representations from triples with entity descriptions. The experiment results show that RLCD gets better performance that state-of-the-art method DKRL, in terms of mean rank value and HITS. Moreover, RLCD is much faster than DKRL.
KW - Complete Semantics
KW - Data Integration
KW - Knowledge Engineering
KW - Knowledge Graphs
KW - Representation Learning
UR - https://www.scopus.com/pages/publications/85042483466
U2 - 10.1109/ICMLC.2017.8107756
DO - 10.1109/ICMLC.2017.8107756
M3 - 会议稿件
AN - SCOPUS:85042483466
T3 - Proceedings of 2017 International Conference on Machine Learning and Cybernetics, ICMLC 2017
SP - 143
EP - 149
BT - Proceedings of 2017 International Conference on Machine Learning and Cybernetics, ICMLC 2017
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 16th International Conference on Machine Learning and Cybernetics, ICMLC 2017
Y2 - 9 July 2017 through 12 July 2017
ER -