Revisiting Initializing Then Refining: An Incomplete and Missing Graph Imputation Network

02/15/2023
by   Wenxuan Tu, et al.
0

With the development of various applications, such as social networks and knowledge graphs, graph data has been ubiquitous in the real world. Unfortunately, graphs usually suffer from being absent due to privacy-protecting policies or copyright restrictions during data collection. The absence of graph data can be roughly categorized into attribute-incomplete and attribute-missing circumstances. Specifically, attribute-incomplete indicates that a part of the attribute vectors of all nodes are incomplete, while attribute-missing indicates that the whole attribute vectors of partial nodes are missing. Although many efforts have been devoted, none of them is custom-designed for a common situation where both types of graph data absence exist simultaneously. To fill this gap, we develop a novel network termed Revisiting Initializing Then Refining (RITR), where we complete both attribute-incomplete and attribute-missing samples under the guidance of a novel initializing-then-refining imputation criterion. Specifically, to complete attribute-incomplete samples, we first initialize the incomplete attributes using Gaussian noise before network learning, and then introduce a structure-attribute consistency constraint to refine incomplete values by approximating a structure-attribute correlation matrix to a high-order structural matrix. To complete attribute-missing samples, we first adopt structure embeddings of attribute-missing samples as the embedding initialization, and then refine these initial values by adaptively aggregating the reliable information of attribute-incomplete samples according to a dynamic affinity structure. To the best of our knowledge, this newly designed method is the first unsupervised framework dedicated to handling hybrid-absent graphs. Extensive experiments on four datasets have verified that our methods consistently outperform existing state-of-the-art competitors.

READ FULL TEXT

page 1

page 12

research
05/05/2023

AmGCL: Feature Imputation of Attribute Missing Graph via Self-supervised Contrastive Learning

Attribute graphs are ubiquitous in multimedia applications, and graph re...
research
02/06/2021

Wasserstein diffusion on graphs with missing attributes

Missing node attributes is a common problem in real-world graphs. Graph ...
research
06/20/2022

Autoencoder-based Attribute Noise Handling Method for Medical Data

Medical datasets are particularly subject to attribute noise, that is, m...
research
10/01/2018

Network Modeling and Pathway Inference from Incomplete Data ("PathInf")

In this work, we developed a network inference method from incomplete da...
research
12/09/2021

Siamese Attribute-missing Graph Auto-encoder

Graph representation learning (GRL) on attribute-missing graphs, which i...
research
08/01/2018

Forest Learning from Data and its Universal Coding

This paper considers structure learning from data with n samples of p va...
research
08/01/2018

Forest Learning Universal Coding

This paper considers structure learning from data with n samples of p va...

Please sign up or login with your details

Forgot password? Click here to reset