Propagation on Multi-relational Graphs for Node Regression
Recent years have witnessed a rise in real-world data captured with rich structural information that can be conveniently depicted by multi-relational graphs. While inference of continuous node features across a simple graph is rather under-studied by the current relational learning research, we go one step further and focus on node regression problem on multi-relational graphs. We take inspiration from the well-known label propagation algorithm aiming at completing categorical features across a simple graph and propose a novel propagation framework for completing missing continuous features at the nodes of a multi-relational and directed graph. Our multi-relational propagation algorithm is composed of iterative neighborhood aggregations which originate from a relational local generative model. Our findings show the benefit of exploiting the multi-relational structure of the data in several node regression scenarios in different settings.
Code (1)
Tasks
Node RegressionregressionRelational ReasoningSimilar Papers 제목 키워드 기반
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 value…
AttributeKnowledge Graph CompletionKnowledge GraphsLink Prediction+1CopulaGNN: Towards Integrating Representational and Correlational Roles of Graphs in Graph Neural Networks
Graph-structured data are ubiquitous. However, graphs encode diverse types of information and thus play different roles in data representation. In this paper, we distinguish the \textit{representational} and the \textit{…
Graph Neural NetworkA Benchmark Dataset for Graph Regression with Homogeneous and Multi-Relational Variants
Graph-level regression underpins many real-world applications, yet public benchmarks remain heavily skewed toward molecular graphs and citation networks. This limited diversity hinders progress on models that must genera…
Graph Neural NetworkGraph RegressionregressionUtilizing Edge Features in Graph Neural Networks via Variational Information Maximization
Graph Neural Networks (GNNs) achieve an impressive performance on structured graphs by recursively updating the representation vector of each node based on its neighbors, during which parameterized transformation matrice…
Drug DiscoveryQuantum Chemistry RegressionUniversally Robust Graph Neural Networks by Preserving Neighbor Similarity
Despite the tremendous success of graph neural networks in learning relational data, it has been widely investigated that graph neural networks are vulnerable to structural attacks on homophilic graphs. Motivated by this…
Adversarial Robustness