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

• URL: http://arxiv.org/abs/2302.07524v1
• Date: Wed, 15 Feb 2023 08:38:06 GMT
• Title: Revisiting Initializing Then Refining: An Incomplete and Missing Graph Imputation Network
• Authors: Wenxuan Tu, Bin Xiao, Xinwang Liu, Sihang Zhou, Zhiping Cai, and Jieren Cheng
• Abstract summary: We develop a novel network termed Revisiting Initializing Then refining (RITR) We complete both attribute-incomplete and attribute-missing samples under the guidance of a novel initializing-then-refining imputation criterion. To the best of our knowledge, this newly designed method is the first unsupervised framework dedicated to handling hybrid-absent graphs.
• Score: 42.68291773745948
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Active Sampling for Node Attribute Completion on Graphs [35.67643493013569]
  This paper proposes a novel AcTive Sampling algorithm (ATS) to restore missing node attributes. The representativeness and uncertainty of each node's information are first measured based on graph structure, representation similarity and learning bias. Experiments on four public benchmark datasets and two downstream tasks have shown the superiority of ATS in node attribute completion.
  arXiv  Detail & Related papers  (2025-01-14T21:38:23Z)
• Enhancing Missing Data Imputation through Combined Bipartite Graph and Complete Directed Graph [18.06658040186476]
  We introduce a novel framework named the Bipartite and Complete Directed Graph Neural Network (BCGNN) Within BCGNN, observations and features are differentiated as two distinct node types, and the values of observed features are converted into attributed edges linking them. In parallel, the complete directed graph segment adeptly outlines and communicates the complex interdependencies among features.
  arXiv  Detail & Related papers  (2024-11-07T17:48:37Z)
• AutoAC: Towards Automated Attribute Completion for Heterogeneous Graph Neural Network [18.47866953955945]
  We propose a differentiable attribute completion framework called AutoAC for automated completion operation search in heterogeneous GNNs. We show that AutoAC outperforms the SOTA handcrafted heterogeneous GNNs and the existing attribute completion method.
  arXiv  Detail & Related papers  (2023-01-08T14:38:32Z)
• GrannGAN: Graph annotation generative adversarial networks [72.66289932625742]
  We consider the problem of modelling high-dimensional distributions and generating new examples of data with complex relational feature structure coherent with a graph skeleton. The model we propose tackles the problem of generating the data features constrained by the specific graph structure of each data point by splitting the task into two phases. In the first it models the distribution of features associated with the nodes of the given graph, in the second it complements the edge features conditionally on the node features.
  arXiv  Detail & Related papers  (2022-12-01T11:49:07Z)
• Label-Free Model Evaluation with Semi-Structured Dataset Representations [78.54590197704088]
  Label-free model evaluation, or AutoEval, estimates model accuracy on unlabeled test sets. In the absence of image labels, based on dataset representations, we estimate model performance for AutoEval with regression. We propose a new semi-structured dataset representation that is manageable for regression learning while containing rich information for AutoEval.
  arXiv  Detail & Related papers  (2021-12-01T18:15:58Z)
• Adaptive Attribute and Structure Subspace Clustering Network [49.040136530379094]
  We propose a novel self-expressiveness-based subspace clustering network. We first consider an auto-encoder to represent input data samples. Then, we construct a mixed signed and symmetric structure matrix to capture the local geometric structure underlying data. We perform self-expressiveness on the constructed attribute structure and matrices to learn their affinity graphs.
  arXiv  Detail & Related papers  (2021-09-28T14:00:57Z)
• Learning the Implicit Semantic Representation on Graph-Structured Data [57.670106959061634]
  Existing representation learning methods in graph convolutional networks are mainly designed by describing the neighborhood of each node as a perceptual whole. We propose a Semantic Graph Convolutional Networks (SGCN) that explores the implicit semantics by learning latent semantic-paths in graphs.
  arXiv  Detail & Related papers  (2021-01-16T16:18:43Z)
• Node Attribute Completion in Knowledge Graphs with Multi-Relational Propagation [14.58440933068]
  Our approach, denoted as MrAP, imputes the values of missing attributes by propagating information across 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.
  arXiv  Detail & Related papers  (2020-11-10T18:36:33Z)
• Learning on Attribute-Missing Graphs [66.76561524848304]
  There is a graph where attributes of only partial nodes could be available and those of the others might be entirely missing. Existing graph learning methods including the popular GNN cannot provide satisfied learning performance. We develop a novel distribution matching based GNN called structure-attribute transformer (SAT) for attribute-missing graphs.
  arXiv  Detail & Related papers  (2020-11-03T11:09:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.