Knowledge Graph Completion by Jointly Learning Structural Features and Soft Logical Rules

With the rapid development and widespread application of Knowledge graphs (KGs) in many artificial intelligence tasks, a large number of efforts have been made to refine them and increase their quality. Knowedge graph embedding (KGE) has become one of the main refinement tasks, which aims to predict missing facts based on existing ones in KGs. However, there are still mainly two difficult unresolved challenges: (i) how to leverage the local structural features of entities and the potential soft logical rules to learn more expressive embedding of entites and relations; and (ii) how to combine these two learning processes into one unified model. To conquer these problems, we propose a novel KGE model named JSSKGE, which can
J
ointly learn the local
S
tructural features of entities and
S
oft logical rules. First, we employ graph attention networks which are specially designed for graph-structured data to aggregate the local structural information of nodes. Then, we utilize soft logical rules implicated in KGs as an expert to further rectify the embeddings of entities and relations. By jointly learning, we can obtain more informative embeddings to predict new facts. With experiments on four commonly used datasets, the JSSKGE obtains better performance than state-of-the-art approaches.