pith. sign in

arxiv: 1906.03220 · v2 · pith:T5SYJMUInew · submitted 2019-06-07 · 💻 cs.LG · stat.ML

Labeled Graph Generative Adversarial Networks

classification 💻 cs.LG stat.ML
keywords generativegraphnetworksadversarialdatagraphsapproachlabeled
0
0 comments X
read the original abstract

As a new approach to train generative models, \emph{generative adversarial networks} (GANs) have achieved considerable success in image generation. This framework has also recently been applied to data with graph structures. We propose labeled-graph generative adversarial networks (LGGAN) to train deep generative models for graph-structured data with node labels. We test the approach on various types of graph datasets, such as collections of citation networks and protein graphs. Experiment results show that our model can generate diverse labeled graphs that match the structural characteristics of the training data and outperforms all alternative approaches in quality and generality. To further evaluate the quality of the generated graphs, we use them on a downstream task of graph classification, and the results show that LGGAN can faithfully capture the important aspects of the graph structure.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Evolutionary Refinement of Generative Graph Topologies: A Hybrid WGAN-GA Approach

    cs.LG 2026-05 unverdicted novelty 3.0

    A genetic algorithm refines output graphs from a WGAN-GNN framework, consistently lowering combined MMD relative to the base generator.