Semantic- and relation-based graph neural network for knowledge graph completion

Semantic- and relation-based graph neural network for knowledge graph completion

연구 분야: Databases

학회: Applied Intelligence

Knowledge graph completion (KGC) refines missing entities, relationships, or attributes from a knowledge graph, which is significant for referral systems, biological informatics, and search engines. As an effective KGC approach, a graph neural network (GNN) learns to aggregate information from neighboring nodes by iteratively passing messages between them. However, the semantic and relational information contained in knowledge graphs is rarely used in the existing GNN-based approaches for KGC (i.e., only structure information is used). Hence, a semantic- and relation-based GNN (SR-GNN) model, which combines the semantic similarity information between neighboring entities and the relational features of knowledge graphs, is proposed. First, we develop an entity semantic aggregation module that learns semantic similarity information among neighboring entities connected to the same central entity via an RNN. Second, we propose a relational aggregation module that captures the different semantics among different types of relations through a GRU. This enables the model to better comprehend semantic relationships and be applied to KGC tasks requiring relationship embedding vectors. Extensive studies conducted on the FB15k-237, WN18RR, WN18 and YAGO3-10 datasets reveal that, when compared to 17 baseline models, the SR-GNN exhibits state-of-the-art performance in terms of the MRR and H@n metrics. Significantly, the MRR metric improves by on the FB15K-237 dataset and by on the WN18RR dataset over those of the rival models.