IAGNN:Graph Neural Networks with Information Augmentation

Graph convolutional neural networks use the message passing mechanism to stack layers to expand the perceptual field of view, as a way to expand the rich neighborhood information for the central node, which brings effective benefits for the processing of non-Euclidean graph data. However, the mechanism has some limitations, on the one hand, in small data samples, the multi-layer network of graph neural networks may lead to some node attributes approximating similar fixed values, which leads to the phenomenon of over-smoothing. On the other hand graph neural networks are overly dependent on the node features already present in the graph data, and the trained model has poor adaptability in the data changing environment, i.e., low generalization performance. In order to address the above limitations of graph neural networks, this paper proposes a graph neural network model with information augmentation (IAGNN), which utilizes a conditional variational auto encoder in the pre-training process to focus on local information enrichment of low-degree nodes while avoiding excessive stacking of graph layers. Thereafter, random feature masking enhancement techniques are utilized to mask some of the feature representations of the nodes, thereby enhancing the model generalization capability. It is shown through experiments and analysis on six public datasets that our proposed IAGNN model can achieve good benefits on the downstream task of graph classification.

Authors

Institutions

Publication Details

Published
2024-09-20
DOI
https://doi.org/10.1109/icwapr63074.2024.10870507
Primary Topic
Neural Networks and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

IAGNN:Graph Neural Networks with Information Augmentation

Xin Yuan, Lixiang Xu, Jun Pan, J Peng et al.
Neural Networks and Applications
article

IAGNN:Graph Neural Networks with Information Augmentation

Xin Yuan, Lixiang Xu, Jun Pan, J Peng, Chen Zhang, Zhen Yang, Kang Jiang
article en

Abstract

Graph convolutional neural networks use the message passing mechanism to stack layers to expand the perceptual field of view, as a way to expand the rich neighborhood information for the central node, which brings effective benefits for the processing of non-Euclidean graph data. However, the mechanism has some limitations, on the one hand, in small data samples, the multi-layer network of graph neural networks may lead to some node attributes approximating similar fixed values, which leads to the phenomenon of over-smoothing. On the other hand graph neural networks are overly dependent on the node features already present in the graph data, and the trained model has poor adaptability in the data changing environment, i.e., low generalization performance. In order to address the above limitations of graph neural networks, this paper proposes a graph neural network model with information augmentation (IAGNN), which utilizes a conditional variational auto encoder in the pre-training process to focus on local information enrichment of low-degree nodes while avoiding excessive stacking of graph layers. Thereafter, random feature masking enhancement techniques are utilized to mask some of the feature representations of the nodes, thereby enhancing the model generalization capability. It is shown through experiments and analysis on six public datasets that our proposed IAGNN model can achieve good benefits on the downstream task of graph classification.

Anhui University (CN), Hefei University (CN), The University of Adelaide (AU)
Openalex Percentile: Top 75%
Neural Networks and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.