GMMDA: Gaussian mixture modeling of graph in latent space for graph data augmentation

Abstract Graph data augmentation (GDA), which manipulates graph structure and/or attributes, has been demonstrated as an effective method for improving the generalization of graph neural networks on semi-supervised node classification. As a data augmentation technique, label preservation is critical, that is, node labels should not change after data manipulation. However, most existing methods overlook the label preservation requirements. Determining the label-preserving nature of a GDA method is highly challenging, owing to the non-Euclidean nature of the graph structure. In this study, for the first time, we formulate a label-preserving problem (LPP) in the context of GDA. The LPP is formulated as an optimization problem in which, given a fixed augmentation budget, the objective is to find an augmented graph with minimal difference in data distribution compared to the original graph. To solve the LPP problem, we propose GMMDA, a generative data augmentation (DA) method based on Gaussian mixture modeling (GMM) of a graph in a latent space. We designed a novel learning objective that jointly learns a low-dimensional graph representation and estimates the GMM. The learning is followed by sampling from the GMM, and the samples are converted back to the graph as additional nodes. To uphold label preservation, we designed a minimum description length (MDL)-based method to select a set of samples that produces the minimum shift in the data distribution captured by the GMM. Through experiments, we demonstrate that GMMDA can improve the performance of graph convolutional network on Cora , Citeseer and Pubmed by as much as $$7.75\%$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>7.75</mml:mn> <mml:mo>%</mml:mo> </mml:mrow> </mml:math> , $$8.75\%$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>8.75</mml:mn> <mml:mo>%</mml:mo> </mml:mrow> </mml:math> and $$5.87\%$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>5.87</mml:mn> <mml:mo>%</mml:mo> </mml:mrow> </mml:math> , respectively, significantly outperforming the state-of-the-art methods.

Authors

Institutions

Publication Details

Journal
Knowledge and Information Systems
Published
2024-08-29
DOI
https://doi.org/10.1007/s10115-024-02207-2
Citations
2
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
0.69

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

GMMDA: Gaussian mixture modeling of graph in latent space for graph data augmentation

Kenji Yamanishi, Linchuan Xu, Yanjin Li
2 citations
Knowledge and Information Systems
Advanced Graph Neural Networks
0.69
article

GMMDA: Gaussian mixture modeling of graph in latent space for graph data augmentation

Kenji Yamanishi, Linchuan Xu, Yanjin Li
article en
2 citations

Abstract

Abstract Graph data augmentation (GDA), which manipulates graph structure and/or attributes, has been demonstrated as an effective method for improving the generalization of graph neural networks on semi-supervised node classification. As a data augmentation technique, label preservation is critical, that is, node labels should not change after data manipulation. However, most existing methods overlook the label preservation requirements. Determining the label-preserving nature of a GDA method is highly challenging, owing to the non-Euclidean nature of the graph structure. In this study, for the first time, we formulate a label-preserving problem (LPP) in the context of GDA. The LPP is formulated as an optimization problem in which, given a fixed augmentation budget, the objective is to find an augmented graph with minimal difference in data distribution compared to the original graph. To solve the LPP problem, we propose GMMDA, a generative data augmentation (DA) method based on Gaussian mixture modeling (GMM) of a graph in a latent space. We designed a novel learning objective that jointly learns a low-dimensional graph representation and estimates the GMM. The learning is followed by sampling from the GMM, and the samples are converted back to the graph as additional nodes. To uphold label preservation, we designed a minimum description length (MDL)-based method to select a set of samples that produces the minimum shift in the data distribution captured by the GMM. Through experiments, we demonstrate that GMMDA can improve the performance of graph convolutional network on Cora , Citeseer and Pubmed by as much as $$7.75\%$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>7.75</mml:mn> <mml:mo>%</mml:mo> </mml:mrow> </mml:math> , $$8.75\%$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>8.75</mml:mn> <mml:mo>%</mml:mo> </mml:mrow> </mml:math> and $$5.87\%$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>5.87</mml:mn> <mml:mo>%</mml:mo> </mml:mrow> </mml:math> , respectively, significantly outperforming the state-of-the-art methods.

Knowledge and Information SystemsVol. 66(12)
The University of Tokyo (JP)
University of Tokyo, Japan Society for the Promotion of Science, Japan Science and Technology Agency
Openalex Percentile: Top 25%
Advanced Graph Neural Networks
0.69
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.