Node Attribute Completion in Knowledge Graphs with Multi-Relational Propagation
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.
Code (1)
Tasks
AttributeKnowledge Graph CompletionKnowledge GraphsLink PredictionregressionSimilar Papers 제목 키워드 기반
Fair Attribute Completion on Graph with Missing Attributes
Tackling unfairness in graph learning models is a challenging task, as the unfairness issues on graphs involve both attributes and topological structures. Existing work on fair graph learning simply assumes that attribut…
AttributeFairnessGraph LearningAutoAC: Towards Automated Attribute Completion for Heterogeneous Graph Neural Network
Many real-world data can be modeled as heterogeneous graphs that contain multiple types of nodes and edges. Meanwhile, due to excellent performance, heterogeneous graph neural networks (GNNs) have received more and more …
AttributeGraph LearningGraph Neural NetworkNode ClusteringHeterogeneous Graph Neural Network via Attribute Completion
Heterogeneous information networks (HINs), also called heterogeneous graphs, are composed of multiple types of nodes and edges, and contain comprehensive information and rich semantics. Graph neural networks (GNNs), as p…
AttributeGraph LearningGraph Neural NetworkLearning on Attribute-Missing Graphs
Graphs with complete node attributes have been widely explored recently. While in practice, there is a graph where attributes of only partial nodes could be available and those of the others might be entirely missing. Th…
AttributeGraph LearningLink PredictionHeGAE-AC: heterogeneous graph auto-encoder for attribute completion
Heterogeneous Graphs (HGs) are widely used to model complex real-world networks that involve multiple types of nodes and relations. Many heterogeneous graph neural networks (HGNNs) based methods have been developed to le…
AttributeGraph Representation LearningRepresentation Learning