Structure embedding for knowledge base completion and analytics

Zili ZHOU, Guandong XU, Wenhao ZHU, Jinyan LI, Wu ZHANG

Research output: Chapter in Book/Report/Conference proceedingChapters

2 Citations (Scopus)


To explore the latent information of Human Knowledge, the analysis for Knowledge Bases (KBs) (e.g. WordNet, Freebase) is essential. Some previous KB element embedding frameworks are used for KBs structure analysis and completion. These embedding frameworks use low-dimensional vector space representation for large scale of entities and relations in KB. Based on that, the vector space representation of entities and relations which are not contained by KB can be measured. The embedding idea is reasonable, while the current embedding methods have some issues to get proper embeddings for KB elements. The embedding methods use entity-relation-entity triplet, contained by most of current KB, as training data to output the embedding representation of entities and relations. To measure the truth of one triplet (The knowledge represented by triplet is true or false), some current embedding methods such as Structured Embedding (SE) project entity vectors into subspace, the meaning of such subspace is not clear for knowledge reasoning. Some other embedding methods such as TransE use simple linear vector transform to represent relation (such as vector add or minus), which can't deal with the multiple relations match or multiple entities match problem. For example, there are multiple relations between two entities, or there are multiple entities have same relation with one entity. 

Insipred by previous KB element structured embedding methods, we propose a new method, Bipartite Graph Network Structured Embedding (BGNSE). BGNSE combines the current KB embedding methods with bipartite graph network model, which is widely used in many fields including image data compression, collaborative filtering. BGNSE embeds each entity-relation-entity KB triplet into a bipartite graph network structure model, represents each entity by one bipartite graph layer, represents relation by link weights matrix of bipartite graph network. Based on bipartite graph model, our proposed method has following advantages. BGNSE model uses one matrix for each relation, the relation transform between two entities can be done directly by forward and backward propagation of bipartite graph network, no need for subspace projection. Because of using bipartite graph network, the relation transforms between entities are nonlinear (network layer propagation), the multiple relations match or multiple entities match problems can be dealt. The learnt entity and relation embeddings can be used for problems such as knowledge base completions. Copyright © 2017 IEEE.

Original languageEnglish
Title of host publicationProceedings of 2017 International Joint Conference on Neural Networks, IJCNN 2017
ISBN (Electronic)9781509061815
Publication statusPublished - Jun 2017


Zhou, Z., Xu, G., Zhu, W., Li, J., & Zhang, W. (2017). Structure embedding for knowledge base completion and analytics. In Proceedings of 2017 International Joint Conference on Neural Networks, IJCNN 2017 (pp. 737-743). IEEE.


Dive into the research topics of 'Structure embedding for knowledge base completion and analytics'. Together they form a unique fingerprint.