Node Attribute Completion in Knowledge Graphs with Multi-Relational Propagation

Abstract

The existing literature on knowledge graph completion mostly focuses on the link prediction task. However, knowledge graphs have an additional incompleteness problem: their nodes possess numerical attributes, whose values are often missing. Our approach, denoted as MrAP, imputes the values of missing attributes by propagating information across the multi-relational structure of a knowledge graph. It employs regression functions for predicting one node attribute from another depending on the relationship between the nodes and the type of the attributes. The propagation mechanism operates iteratively in a message passing scheme that collects the predictions at every iteration and updates the value of the node attributes. Experiments over two benchmark datasets show the effectiveness of our approach.

arXiv comment7 pages

References in corpus (10)

• KGAT: Knowledge Graph Attention Network for Recommendation
• A Review of Relational Machine Learning for Knowledge Graphs
• Fast Graph Representation Learning with PyTorch Geometric
• Relational Graph Attention Networks
• Inductive Relation Prediction by Subgraph Reasoning
• KBLRN : End-to-End Learning of Knowledge Base Representations with Latent, Relational, and Numerical Features
• GNN-FiLM: Graph Neural Networks with Feature-wise Linear Modulation
• Interpretable Graph Convolutional Neural Networks for Inference on Noisy Knowledge Graphs
• Few-shot link prediction via graph neural networks for Covid-19 drug-repurposing
• Knowledge Embedding Based Graph Convolutional Network