Entity-related paths modeling for knowledge base completion

摘要

Knowledge bases (KBs) are far from complete, necessitating a demand for KB completion. Among various methods, embedding has received increasing attention in recent years. PTransE, an important approach using embedding method in KB completion, considers multiple-step relation paths based on TransE, but ignores the association between entity and their related entities with the same direct relationships. In this paper, we propose an approach called EP-TransE, which considers this kind of association. As a matter of fact, the dissimilarity of these related entities should be taken into consideration and it should not exceed a certain threshold. EPTransE adjusts the embedding vector of an entity by comparing it with its related entities which are connected by the same direct relationship. EPTransE further makes the euclidean distance between them less than a certain threshold. Therefore, the embedding vectors of entities are able to contain rich semantic information, which is valuable for KB completion. In experiments, we evaluated our approach on two tasks, including entity prediction and relation prediction. Experimental results show that our idea of considering the dissimilarity of related entities with the same direct relationships is effective.