Transcription of Knowledge Graph Embedding via Dynamic Mapping Matrix
{{id}} {{{paragraph}}}
Knowledge Graph Embedding via Dynamic Mapping Matrix Guoliang Ji, Shizhu He, Liheng Xu, Kang Liu and Jun Zhao National Laboratory of Pattern Recognition (NLPR). Institute of Automation Chinese Academy of Sciences, Beijing, 100190, China Abstract completion is to predict relations between entities based on existing triplets in a Knowledge Graph . In Knowledge graphs are useful resources for the past decade, much work based on symbol and numerous AI applications, but they are far logic has been done for Knowledge Graph comple- from completeness. Previous work such as tion, but they are neither tractable nor enough con- TransE, TransH and TransR/CTransR re- vergence for large scale Knowledge graphs.
of several embedding models. N e and N r represent the number of entities and relations, respectively. N t represents the number of triplets in a knowledge graph. m is the dimension of entity embedding space and n is the dimension of relation embedding space. d denotes the average number of clusters of a
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}