AutoAC: Towards Automated Attribute Completion for Heterogeneous Graph Neural Network

• URL: http://arxiv.org/abs/2301.03049v1
• Date: Sun, 8 Jan 2023 14:38:32 GMT
• Title: AutoAC: Towards Automated Attribute Completion for Heterogeneous Graph Neural Network
• Authors: Guanghui Zhu, Zhennan Zhu, Wenjie Wang, Zhuoer Xu, Chunfeng Yuan, Yihua Huang
• Abstract summary: 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.
• Score: 18.47866953955945
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 attention. However, the existing work mainly focuses on the design of novel GNN models, while ignoring another important issue that also has a large impact on the model performance, namely the missing attributes of some node types. The handcrafted attribute completion requires huge expert experience and domain knowledge. Also, considering the differences in semantic characteristics between nodes, the attribute completion should be fine-grained, i.e., the attribute completion operation should be node-specific. Moreover, to improve the performance of the downstream graph learning task, attribute completion and the training of the heterogeneous GNN should be jointly optimized rather than viewed as two separate processes. To address the above challenges, we propose a differentiable attribute completion framework called AutoAC for automated completion operation search in heterogeneous GNNs. We first propose an expressive completion operation search space, including topology-dependent and topology-independent completion operations. Then, we propose a continuous relaxation schema and further propose a differentiable completion algorithm where the completion operation search is formulated as a bi-level joint optimization problem. To improve the search efficiency, we leverage two optimization techniques: discrete constraints and auxiliary unsupervised graph node clustering. Extensive experimental results on real-world datasets reveal that AutoAC outperforms the SOTA handcrafted heterogeneous GNNs and the existing attribute completion method

Related papers

• Matcha: Mitigating Graph Structure Shifts with Test-Time Adaptation [66.40525136929398]
  Test-time adaptation (TTA) has attracted attention due to its ability to adapt a pre-trained model to a target domain, without re-accessing the source domain. We propose Matcha, an innovative framework designed for effective and efficient adaptation to structure shifts in graphs. We validate the effectiveness of Matcha on both synthetic and real-world datasets, demonstrating its robustness across various combinations of structure and attribute shifts.
  arXiv  Detail & Related papers  (2024-10-09T15:15:40Z)
• AGHINT: Attribute-Guided Representation Learning on Heterogeneous Information Networks with Transformer [4.01252998015631]
  We investigate the impact of inter-node attribute disparities on HGNNs performance within a benchmark task. We propose a novel Attribute-Guided heterogeneous Information Networks representation learning model with Transformer (AGHINT) AGHINT transcends the constraints of the original graph structure by directly integrating higher-order similar neighbor features into the learning process.
  arXiv  Detail & Related papers  (2024-04-16T10:30:48Z)
• Enhanced Graph Neural Networks with Ego-Centric Spectral Subgraph Embeddings Augmentation [11.841882902141696]
  We present a novel approach denoted as Ego-centric Spectral subGraph Embedding Augmentation (ESGEA) ESGEA aims to enhance and design node features, particularly in scenarios where information is lacking. We evaluate the proposed method in a social network graph classification task where node attributes are unavailable.
  arXiv  Detail & Related papers  (2023-10-10T14:57:29Z)
• Collaborative Graph Neural Networks for Attributed Network Embedding [63.39495932900291]
  Graph neural networks (GNNs) have shown prominent performance on attributed network embedding. We propose COllaborative graph Neural Networks--CONN, a tailored GNN architecture for network embedding.
  arXiv  Detail & Related papers  (2023-07-22T04:52:27Z)
• NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classification [70.51126383984555]
  We introduce a novel all-pair message passing scheme for efficiently propagating node signals between arbitrary nodes. The efficient computation is enabled by a kernerlized Gumbel-Softmax operator. Experiments demonstrate the promising efficacy of the method in various tasks including node classification on graphs.
  arXiv  Detail & Related papers  (2023-06-14T09:21:15Z)
• T2-GNN: Graph Neural Networks for Graphs with Incomplete Features and Structure via Teacher-Student Distillation [65.43245616105052]
  Graph Neural Networks (GNNs) have been a prevailing technique for tackling various analysis tasks on graph data. In this paper, we propose a general GNN framework based on teacher-student distillation to improve the performance of GNNs on incomplete graphs.
  arXiv  Detail & Related papers  (2022-12-24T13:49:44Z)
• Exploiting Neighbor Effect: Conv-Agnostic GNNs Framework for Graphs with Heterophily [58.76759997223951]
  We propose a new metric based on von Neumann entropy to re-examine the heterophily problem of GNNs. We also propose a Conv-Agnostic GNN framework (CAGNNs) to enhance the performance of most GNNs on heterophily datasets.
  arXiv  Detail & Related papers  (2022-03-19T14:26:43Z)
• Data Augmentation for Graph Convolutional Network on Semi-Supervised Classification [6.619370466850894]
  We study the problem of graph data augmentation for Graph Convolutional Network (GCN) Specifically, we conduct cosine similarity based cross operation on the original features to create new graph features, including new node attributes. We also propose an attentional integrating model to weighted sum the hidden node embeddings encoded by these GCNs into the final node embeddings.
  arXiv  Detail & Related papers  (2021-06-16T15:13:51Z)
• 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)
• Multi-grained Semantics-aware Graph Neural Networks [13.720544777078642]
  Graph Neural Networks (GNNs) are powerful techniques in representation learning for graphs. This work proposes a unified model, AdamGNN, to interactively learn node and graph representations. Experiments on 14 real-world graph datasets show that AdamGNN can significantly outperform 17 competing models on both node- and graph-wise tasks.
  arXiv  Detail & Related papers  (2020-10-01T07:52:06Z)
• Graph Convolutional Networks for Graphs Containing Missing Features [5.426650977249329]
  We propose an approach that adapts Graph Convolutional Network (GCN) to graphs containing missing features. In contrast to traditional strategy, our approach integrates the processing of missing features and graph learning within the same neural network architecture. We demonstrate through extensive experiments that our approach significantly outperforms the imputation-based methods in node classification and link prediction tasks.
  arXiv  Detail & Related papers  (2020-07-09T06:47:21Z)

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.