An overview of embedding models of entities and relationships for knowledge base completion

# An overview of embedding models of entities and relationships for knowledge base completion

Dat Quoc Nguyen

Department of Computing
Macquarie University, Sydney, Australia
dat.nguyen@students.mq.edu.au
###### Abstract

Knowledge bases of real-world facts about entities and their relationships are useful resources for a variety of natural language processing tasks. However, because knowledge bases are typically incomplete, it is useful to be able to perform knowledge base completion or link prediction, i.e., predict whether a relationship not in the knowledge base is likely to be true. This article presents an overview of embedding models of entities and relationships for knowledge base completion.

Keywords: Knowledge base completion, link prediction, embedding model, triple classification, entity prediction.

An overview of embedding models of entities and relationships
for knowledge base completion

Dat Quoc Nguyen Department of Computing Macquarie University, Sydney, Australia dat.nguyen@students.mq.edu.au

## 1 Introduction

Knowledge bases (KBs), such as WordNet [Miller, 1995], YAGO [Suchanek et al., 2007], Freebase [Bollacker et al., 2008] and DBpedia [Lehmann et al., 2015], represent relationships between entities as triples . Even very large knowledge bases are still far from complete [Socher et al., 2013, West et al., 2014]. Knowledge base completion or link prediction systems [Nickel et al., 2016a] predict which triples not in a knowledge base are likely to be true [Taskar et al., 2004, Bordes et al., 2011].

Embedding models for KB completion associate entities and/or relations with dense feature vectors or matrices. Such models obtain the state-of-the-art performances [Bordes et al., 2013, Wang et al., 2014, Guu et al., 2015, Nguyen et al., 2016a, Nguyen et al., 2016b] and generalize to large KBs [Krompaß et al., 2015]. This article serves as a brief overview of embedding models for KB completion, with up-to-date experimental results on two standard evaluation tasks: i) the entity prediction task—which is also referred to as the link prediction task [Bordes et al., 2013]—and ii) the triple classification task [Socher et al., 2013].

## 2 Embedding models for KB completion

### 2.1 General idea

Let denote the set of entities and the set of relation types. Denote by the knowledge base consisting of a set of correct triples , such that and . For each triple , the embedding models define a score function of its implausibility. Their goal is to choose such that the score of a plausible triple is smaller than the score of an implausible triple .

Table 1 summarizes different score functions and the optimization algorithms used to estimate model parameters, e.g., vanilla Stochastic Gradient Descent (SGD), SGD+AdaGrad [Duchi et al., 2011], SGD+AdaDelta [Zeiler, 2012] and L-BFGS [Liu and Nocedal, 1989]. To learn model parameters (i.e. entity vectors, relation vectors or matrices), the embedding models minimize an objective function. A common objective function is the following margin-based function:

 L =∑(h,r,t)∈G(h′,r,t′)∈G′(h,r,t)[γ+f(h,r,t)−f(h′,r,t′)]+

where , is the margin hyper-parameter, and

 G′(h,r,t) ={(h′,r,t)∣h′∈E,(h′,r,t)∉G} ∪{(h,r,t′)∣t′∈E,(h,r,t′)∉G}

is the set of incorrect triples generated by corrupting the correct triple .

### 2.2 Specific models

The Unstructured model [Bordes et al., 2012] assumes that the head and tail entity vectors are similar. As the Unstructured model does not take the relationship into account, it cannot distinguish different relation types. The Structured Embedding (SE) model [Bordes et al., 2011] extends the Unstructured model by assuming that the head and tail entities are similar only in a relation-dependent subspace, where each relation is represented by two different matrices. Futhermore, the SME model [Bordes et al., 2012] uses four different matrices to project entity and relation vectors into a subspace. The TransE model [Bordes et al., 2013] is inspired by models such as the Word2Vec Skip-gram model [Mikolov et al., 2013] where relationships between words often correspond to translations in latent feature space.

The TransH model [Wang et al., 2014] associates each relation with a relation-specific hyperplane and uses a projection vector to project entity vectors onto that hyperplane. TransD [Ji et al., 2015] and TransR/CTransR [Lin et al., 2015b] extend the TransH model by using two projection vectors and a matrix to project entity vectors into a relation-specific space, respectively. Similar to TransR, TransR-FT [Feng et al., 2016a] also uses a matrix to project head and tail entity vectors. TEKE_H [Wang and Li, 2016] extends TransH to incorporate rich context information in an external text corpus. lppTransD [Yoon et al., 2016] extends TransD to additionally use two projection vectors for representing each relation. STransE [Nguyen et al., 2016b] and TranSparse [Ji et al., 2016] can be viewed as direct extensions of the TransR model, where head and tail entities are associated with their own projection matrices. Unlike STransE, TranSparse uses adaptive sparse matrices, whose sparse degrees are defined based on the number of entities linked by relations.

DISTMULT [Yang et al., 2015] is based on the Bilinear model [Nickel et al., 2011, Bordes et al., 2012, Jenatton et al., 2012] where each relation is represented by a diagonal rather than a full matrix. The neural tensor network (NTN) model [Socher et al., 2013] uses a bilinear tensor operator to represent each relation while ER-MLP [Dong et al., 2014] and ProjE [Shi and Weninger, 2017] could be viewed as simplified versions of NTN. Such quadratic forms are also used to model entities and relations in KG2E [He et al., 2015], TransG [Xiao et al., 2016], ComplEx [Trouillon et al., 2016], TATEC [García-Durán et al., 2016] and RSTE [Tay et al., 2017]. In addition, HolE [Nickel et al., 2016b] uses circular correlation—a compositional operator—which could be interpreted as a compression of the tensor product.

Recent research has shown that relation paths between entities in KBs provide richer context information and improve the performance of embedding models for KB completion [Luo et al., 2015, Lin et al., 2015a, Liang and Forbus, 2015, García-Durán et al., 2015, Guu et al., 2015, Toutanova et al., 2016, Nguyen et al., 2016a].

?) constructed relation paths between entities and viewing entities and relations in the path as pseudo-words, and then applied Word2Vec algorithms [Mikolov et al., 2013] to produce pre-trained vectors for these pseudo-words. ?) showed that using these pre-trained vectors for initialization helps to improve the performance of the TransE [Bordes et al., 2013], SME [Bordes et al., 2012] and SE [Bordes et al., 2011]. In addition, ?) used the implausibility score produced by SME to compute the weights of relation paths.

Furthermore, rTransE [García-Durán et al., 2015], PTransE [Lin et al., 2015a] and TransE-comp [Guu et al., 2015] are extensions of the TransE model. These models similarly represent a relation path by a vector which is the sum of the vectors of all relations in the path, whereas in the Bilinear-comp model [Guu et al., 2015] and the pruned-paths model [Toutanova et al., 2016], each relation is a matrix and so it represents the relation path by matrix multiplication. The neighborhood mixture model TransE-NMM [Nguyen et al., 2016a] can be also viewed as a three-relation path model as it takes into account the neighborhood entity and relation information of both head and tail entities in each triple.

Other relation path-based models: The Path Ranking Algorithm (PRA) [Lao and Cohen, 2010] is a random walk inference technique which was proposed to predict a new relationship between two entities in KBs. ?) used PRA to estimate the probability of an unseen triple as a combination of weighted random walks that follow different paths linking the head entity and tail entity in the KB. ?) made use of an external text corpus to increase the connectivity of the KB used as the input to PRA. ?) improved PRA by proposing a subgraph feature extraction technique to make the generation of random walks in KBs more efficient and expressive, while ?) extended PRA to couple the path ranking of multiple relations. PRA can also be used in conjunction with first-order formula in the discriminative Gaifman model [Niepert, 2016]. In addition, ?) used a recurrent neural network to learn vector representations of PRA-style relation paths between entities in the KB. Other random-walk based learning algorithms for KB completion can be also found in ?), ?) and ?).

See other methods for learning from KBs and multi-relational data in ?).

Two standard tasks are proposed to evaluate embedding models for KB completion including: the entity prediction task, i.e. link prediction [Bordes et al., 2013], and the triple classification task [Socher et al., 2013].

Commonly, the WN18 and FB15k datasets [Bordes et al., 2013] are used for entity prediction evaluation, while the WN11 and FB13 datasets [Socher et al., 2013] are used for triple classification. WN18 and WN11 are derived from the large lexical KB WordNet [Miller, 1995]. FB15k and FB13 are derived from the large real-world fact KB FreeBase [Bollacker et al., 2008]. Information about these datasets is given in Table 2.

### 3.1 Entity prediction

The entity prediction task, i.e. link prediction [Bordes et al., 2013], predicts the head or the tail entity given the relation type and the other entity, i.e. predicting given or predicting given where denotes the missing element. The results are evaluated using a ranking induced by the function on test triples.

Each correct test triple is corrupted by replacing either its head or tail entity by each of the possible entities in turn, and then these candidates are ranked in ascending order of their implausibility score. This is called as the “Raw” setting protocol. Furthermore, the “Filtered” setting protocol, described in ?), filters out before ranking any corrupted triples that appear in the KB. Ranking a corrupted triple appearing in the KB (i.e. a correct triple) higher than the original test triple is also correct, but is penalized by the “Raw” score, thus the “Filtered” setting provides a clearer view on the ranking performance.

In addition to the mean rank and the Hits@10 (i.e., the proportion of test triples for which the target entity was ranked in the top 10 predictions), which were originally used in the entity prediction task [Bordes et al., 2013], recent work also reports the mean reciprocal rank (MRR) which is commonly used in information retrieval. In both “Raw” and “Filtered” settings, mean rank is always greater or equal to 1 and the lower mean rank indicates better entity prediction performance. MRR and Hits@10 scores always range from 0.0 to 1.0, and higher score reflects better prediction result.

#### 3.1.2 Main results

Table 3 lists the entity prediction results of KB completion models on the WN18 and FB15k datasets. The first 18 rows report the performance of the models that do not exploit information about alternative paths between head and tail entities. The next 5 rows report results of the models that exploit information about relation paths. The last 3 rows present results for the models which make use of textual mentions derived from a large external corpus. It is clear that the models with the additional external corpus information obtained the best results. Table 3 also shows that the models employing path information generally achieve better results than models that do not use such information. In terms of models not exploiting path information or external information, the ComplEx model obtains highest scores on FB15k. In addition, the STransE model performs better than its closely related models SE, TransE, TransR, CTransR, TransD and TranSparse on both WN18 and FB15k.

### 3.2 Triple classification

The triple classification task was first introduced by ?), and since then it has been used to evaluate various embedding models. The aim of this task is to predict whether a triple is correct or not. For classification, a relation-specific threshold is set for each relation type . If the implausibility score of an unseen test triple is smaller than then the triple will be classified as correct, otherwise incorrect. Following ?), the relation-specific thresholds are determined by maximizing the micro-averaged accuracy, which is a per-triple average, on the validation set.

#### 3.2.2 Main results

Table 4 presents the triple classification results of KB completion models on the WN11 and FB13 datasets.111In fact, as shown in tables 3 and 4, TransE obtains a very competitive performance on entity prediction and triple classification tasks. The similar observation is also found by ?), ?) and ?). The reason is due to a careful grid search. The first 6 rows report the performance of models that use TransE to initialize the entity and relation vectors. The last 11 rows present the accuracy of models with randomly initialized parameters. Note that there are higher results reported for NTN, Bilinear-comp and TransE-comp when entity vectors are initialized by averaging the pre-trained word vectors [Mikolov et al., 2013, Pennington et al., 2014]. It is not surprising as many entity names in WordNet and FreeBase are lexically meaningful. It is possible for all other embedding models to utilize the pre-trained word vectors as well. However, as pointed out by ?) and ?), averaging the pre-trained word vectors for initializing entity vectors is an open problem and it is not always useful since entity names in many domain-specific KBs are not lexically meaningful.

## 4 Conclusions and further discussion

This article presented an overview of embedding models of entity and relationships for KB completion. The article also provided update-to-date experimental results of the embedding models on the entity prediction and triple classification tasks.

It would be interesting to further explore those models for a new application where triple-style data is available. For example, ?) extended the STransE model [Nguyen et al., 2016b] for the search personalization task in information retrieval, to model a user-oriented relationship between query and document.

## References

• [Bollacker et al., 2008] Kurt Bollacker, Colin Evans, Praveen Paritosh, Tim Sturge, and Jamie Taylor. 2008. Freebase: A Collaboratively Created Graph Database for Structuring Human Knowledge. In Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pages 1247–1250.
• [Bordes et al., 2011] Antoine Bordes, Jason Weston, Ronan Collobert, and Yoshua Bengio. 2011. Learning Structured Embeddings of Knowledge Bases. In Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, pages 301–306.
• [Bordes et al., 2012] Antoine Bordes, Xavier Glorot, Jason Weston, and Yoshua Bengio. 2012. A Semantic Matching Energy Function for Learning with Multi-relational Data. Machine Learning, 94(2):233–259.
• [Bordes et al., 2013] Antoine Bordes, Nicolas Usunier, Alberto Garcia-Duran, Jason Weston, and Oksana Yakhnenko. 2013. Translating Embeddings for Modeling Multi-relational Data. In Advances in Neural Information Processing Systems 26, pages 2787–2795.
• [Dong et al., 2014] Xin Dong, Evgeniy Gabrilovich, Geremy Heitz, Wilko Horn, Ni Lao, Kevin Murphy, Thomas Strohmann, Shaohua Sun, and Wei Zhang. 2014. Knowledge vault: A web-scale approach to probabilistic knowledge fusion. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 601–610.
• [Duchi et al., 2011] John Duchi, Elad Hazan, and Yoram Singer. 2011. Adaptive Subgradient Methods for Online Learning and Stochastic Optimization. The Journal of Machine Learning Research, 12:2121–2159.
• [Feng et al., 2016a] Jun Feng, Minlie Huang, Mingdong Wang, Mantong Zhou, Yu Hao, and Xiaoyan Zhu. 2016a. Knowledge graph embedding by flexible translation. In Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, pages 557–560.
• [Feng et al., 2016b] Jun Feng, Minlie Huang, Yang Yang, and xiaoyan zhu. 2016b. GAKE: Graph Aware Knowledge Embedding. In Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers, pages 641–651.
• [García-Durán et al., 2015] Alberto García-Durán, Antoine Bordes, and Nicolas Usunier. 2015. Composing Relationships with Translations. In Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, pages 286–290.
• [García-Durán et al., 2016] Alberto García-Durán, Antoine Bordes, Nicolas Usunier, and Yves Grandvalet. 2016. Combining Two and Three-Way Embedding Models for Link Prediction in Knowledge Bases. Journal of Artificial Intelligence Research, 55:715–742.
• [Gardner and Mitchell, 2015] Matt Gardner and Tom Mitchell. 2015. Efficient and Expressive Knowledge Base Completion Using Subgraph Feature Extraction. In Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, pages 1488–1498.
• [Gardner et al., 2014] Matt Gardner, Partha P. Talukdar, Jayant Krishnamurthy, and Tom M. Mitchell. 2014. Incorporating Vector Space Similarity in Random Walk Inference over Knowledge Bases. In Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing, pages 397–406.
• [Guu et al., 2015] Kelvin Guu, John Miller, and Percy Liang. 2015. Traversing Knowledge Graphs in Vector Space. In Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, pages 318–327.
• [He et al., 2015] Shizhu He, Kang Liu, Guoliang Ji, and Jun Zhao. 2015. Learning to Represent Knowledge Graphs with Gaussian Embedding. In Proceedings of the 24th ACM International on Conference on Information and Knowledge Management, pages 623–632.
• [Jenatton et al., 2012] Rodolphe Jenatton, Nicolas L. Roux, Antoine Bordes, and Guillaume R Obozinski. 2012. A latent factor model for highly multi-relational data. In Advances in Neural Information Processing Systems 25, pages 3167–3175.
• [Ji et al., 2015] Guoliang Ji, Shizhu He, Liheng Xu, Kang Liu, and Jun Zhao. 2015. Knowledge Graph Embedding via Dynamic Mapping Matrix. In Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), pages 687–696.
• [Ji et al., 2016] Guoliang Ji, Kang Liu, Shizhu He, and Jun Zhao. 2016. Knowledge Graph Completion with Adaptive Sparse Transfer Matrix. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, pages 985–991.
• [Krompaß et al., 2015] Denis Krompaß, Stephan Baier, and Volker Tresp. 2015. Type-Constrained Representation Learning in Knowledge Graphs. In Proceedings of the 14th International Semantic Web Conference, pages 640–655.
• [Lao and Cohen, 2010] Ni Lao and William W. Cohen. 2010. Relational retrieval using a combination of path-constrained random walks. Machine Learning, 81(1):53–67.
• [Lao et al., 2011] Ni Lao, Tom Mitchell, and William W. Cohen. 2011. Random Walk Inference and Learning in a Large Scale Knowledge Base. In Proceedings of the Conference on Empirical Methods in Natural Language Processing, pages 529–539.
• [Lehmann et al., 2015] Jens Lehmann, Robert Isele, Max Jakob, Anja Jentzsch, Dimitris Kontokostas, Pablo N. Mendes, Sebastian Hellmann, Mohamed Morsey, Patrick van Kleef, Sören Auer, and Christian Bizer. 2015. DBpedia - A Large-scale, Multilingual Knowledge Base Extracted from Wikipedia. Semantic Web, 6(2):167–195.
• [Liang and Forbus, 2015] Chen Liang and Kenneth D. Forbus. 2015. Learning Plausible Inferences from Semantic Web Knowledge by Combining Analogical Generalization with Structured Logistic Regression. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, pages 551–557.
• [Lin et al., 2015a] Yankai Lin, Zhiyuan Liu, Huanbo Luan, Maosong Sun, Siwei Rao, and Song Liu. 2015a. Modeling Relation Paths for Representation Learning of Knowledge Bases. In Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, pages 705–714.
• [Lin et al., 2015b] Yankai Lin, Zhiyuan Liu, Maosong Sun, Yang Liu, and Xuan Zhu. 2015b. Learning Entity and Relation Embeddings for Knowledge Graph Completion. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence Learning, pages 2181–2187.
• [Liu and Nocedal, 1989] D. C. Liu and J. Nocedal. 1989. On the Limited Memory BFGS Method for Large Scale Optimization. Mathematical Programming, 45(3):503–528.
• [Liu et al., 2016] Qiao Liu, Liuyi Jiang, Minghao Han, Yao Liu, and Zhiguang Qin. 2016. Hierarchical Random Walk Inference in Knowledge Graphs. In Proceedings of the 39th International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 445–454.
• [Luo et al., 2015] Yuanfei Luo, Quan Wang, Bin Wang, and Li Guo. 2015. Context-Dependent Knowledge Graph Embedding. In Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, pages 1656–1661.
• [Mikolov et al., 2013] Tomas Mikolov, Ilya Sutskever, Kai Chen, Greg S Corrado, and Jeff Dean. 2013. Distributed Representations of Words and Phrases and their Compositionality. In Advances in Neural Information Processing Systems 26, pages 3111–3119.
• [Miller, 1995] George A. Miller. 1995. WordNet: A Lexical Database for English. Communications of the ACM, 38(11):39–41.
• [Neelakantan et al., 2015] Arvind Neelakantan, Benjamin Roth, and Andrew McCallum. 2015. Compositional Vector Space Models for Knowledge Base Completion. In Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), pages 156–166.
• [Nguyen et al., 2016a] Dat Quoc Nguyen, Kairit Sirts, Lizhen Qu, and Mark Johnson. 2016a. Neighborhood Mixture Model for Knowledge Base Completion. In Proceedings of The 20th SIGNLL Conference on Computational Natural Language Learning, pages 40–50.
• [Nguyen et al., 2016b] Dat Quoc Nguyen, Kairit Sirts, Lizhen Qu, and Mark Johnson. 2016b. STransE: a novel embedding model of entities and relationships in knowledge bases. In Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pages 460–466.
• [Nickel et al., 2011] Maximilian Nickel, Volker Tresp, and Hans-Peter Kriegel. 2011. A Three-Way Model for Collective Learning on Multi-Relational Data. In Proceedings of the 28th International Conference on Machine Learning, pages 809–816.
• [Nickel et al., 2016a] Maximilian Nickel, Kevin Murphy, Volker Tresp, and Evgeniy Gabrilovich. 2016a. A Review of Relational Machine Learning for Knowledge Graphs. Proceedings of the IEEE, 104(1):11–33.
• [Nickel et al., 2016b] Maximilian Nickel, Lorenzo Rosasco, and Tomaso Poggio. 2016b. Holographic embeddings of knowledge graphs. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, pages 1955–1961.
• [Niepert, 2016] Mathias Niepert. 2016. Discriminative Gaifman Models. In Advances in Neural Information Processing Systems 29, pages 3405–3413.
• [Pennington et al., 2014] Jeffrey Pennington, Richard Socher, and Christopher Manning. 2014. Glove: Global Vectors for Word Representation. In Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing, pages 1532–1543.
• [Shi and Weninger, 2017] Baoxu Shi and Tim Weninger. 2017. ProjE: Embedding Projection for Knowledge Graph Completion. In Proceedings of the 31st AAAI Conference on Artificial Intelligence.
• [Socher et al., 2013] Richard Socher, Danqi Chen, Christopher D Manning, and Andrew Ng. 2013. Reasoning With Neural Tensor Networks for Knowledge Base Completion. In Advances in Neural Information Processing Systems 26, pages 926–934.
• [Suchanek et al., 2007] Fabian M. Suchanek, Gjergji Kasneci, and Gerhard Weikum. 2007. YAGO: A Core of Semantic Knowledge. In Proceedings of the 16th International Conference on World Wide Web, pages 697–706.
• [Taskar et al., 2004] Ben Taskar, Ming fai Wong, Pieter Abbeel, and Daphne Koller. 2004. Link Prediction in Relational Data. In Advances in Neural Information Processing Systems 16, pages 659–666.
• [Tay et al., 2017] Yi Tay, Anh Tuan Luu, Siu Cheung Hui, and Falk Brauer. 2017. Random Semantic Tensor Ensemble for Scalable Knowledge Graph Link Prediction. In Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, pages 751–760.
• [Toutanova and Chen, 2015] Kristina Toutanova and Danqi Chen. 2015. Observed Versus Latent Features for Knowledge Base and Text Inference. In Proceedings of the 3rd Workshop on Continuous Vector Space Models and their Compositionality, pages 57–66.
• [Toutanova et al., 2016] Kristina Toutanova, Victoria Lin, Wen-tau Yih, Hoifung Poon, and Chris Quirk. 2016. Compositional Learning of Embeddings for Relation Paths in Knowledge Base and Text. In Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 1434–1444.
• [Trouillon et al., 2016] Théo Trouillon, Johannes Welbl, Sebastian Riedel, Éric Gaussier, and Guillaume Bouchard. 2016. Complex Embeddings for Simple Link Prediction. In Proceedings of the 33nd International Conference on Machine Learning, pages 2071–2080.
• [Vu et al., 2017] Thanh Vu, Dat Quoc Nguyen, Mark Johnson, Dawei Song, and Alistair Willis. 2017. Search Personalization with Embeddings. In Proceedings of the 39th European Conference on Information Retrieval.
• [Wang and Li, 2016] Zhigang Wang and Juan-Zi Li. 2016. Text-Enhanced Representation Learning for Knowledge Graph. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, pages 1293–1299.
• [Wang et al., 2014] Zhen Wang, Jianwen Zhang, Jianlin Feng, and Zheng Chen. 2014. Knowledge Graph Embedding by Translating on Hyperplanes. In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, pages 1112–1119.
• [Wang et al., 2016] Quan Wang, Jing Liu, Yuanfei Luo, Bin Wang, and Chin-Yew Lin. 2016. Knowledge Base Completion via Coupled Path Ranking. In Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 1308–1318.
• [Wei et al., 2016] Zhuoyu Wei, Jun Zhao, and Kang Liu. 2016. Mining Inference Formulas by Goal-Directed Random Walks. In Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing, pages 1379–1388.
• [West et al., 2014] Robert West, Evgeniy Gabrilovich, Kevin Murphy, Shaohua Sun, Rahul Gupta, and Dekang Lin. 2014. Knowledge Base Completion via Search-based Question Answering. In Proceedings of the 23rd International Conference on World Wide Web, pages 515–526.
• [Xiao et al., 2016] Han Xiao, Minlie Huang, and Xiaoyan Zhu. 2016. TransG : A Generative Model for Knowledge Graph Embedding. In Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 2316–2325.
• [Xiao et al., 2017] Han Xiao, Minlie Huang, and Xiaoyan Zhu. 2017. SSP: semantic space projection for knowledge graph embedding with text descriptions. In Proceedings of the 31st AAAI Conference on Artificial Intelligence.
• [Yang et al., 2015] Bishan Yang, Wen-tau Yih, Xiaodong He, Jianfeng Gao, and Li Deng. 2015. Embedding Entities and Relations for Learning and Inference in Knowledge Bases. In Proceedings of the International Conference on Learning Representations.
• [Yoon et al., 2016] Hee-Geun Yoon, Hyun-Je Song, Seong-Bae Park, and Se-Young Park. 2016. A Translation-Based Knowledge Graph Embedding Preserving Logical Property of Relations. In Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pages 907–916.
You are adding the first comment!
How to quickly get a good reply:
• Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
• Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
• Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
The feedback must be of minimum 40 characters and the title a minimum of 5 characters