Can GAN Learn Topological Features of a Graph?
arXiv:1707.06197
Abstract
This paper is first-line research expanding GANs into graph topology analysis. By leveraging the hierarchical connectivity structure of a graph, we have demonstrated that generative adversarial networks (GANs) can successfully capture topological features of any arbitrary graph, and rank edge sets by different stages according to their contribution to topology reconstruction. Moreover, in addition to acting as an indicator of graph reconstruction, we find that these stages can also preserve important topological features in a graph.
References in corpus (11)
- Adam: A Method for Stochastic Optimization
- Fast unfolding of communities in large networks
- Semi-Supervised Classification with Graph Convolutional Networks
- Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks
- Deep Generative Image Models using a Laplacian Pyramid of Adversarial Networks
- Deep Convolutional Networks on Graph-Structured Data
- NIPS 2016 Tutorial: Generative Adversarial Networks
- InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Nets
- Energy-based Generative Adversarial Network
- f-GAN: Training Generative Neural Samplers using Variational Divergence Minimization
- Deep Community Detection