Giter VIP home page Giter VIP logo

netgan's Introduction

NetGAN: Generating Graphs via Random Walks

Implementation of the method proposed in the paper:
NetGAN: Generating Graphs via Random Walks

by Aleksandar Bojchevski, Oleksandr Shchur, Daniel Zügner, Stephan Günnemann
Published at ICML 2018 in Stockholm, Sweden.

Copyright (C) 2018
Daniel Zügner
Technical University of Munich

This implementation is written in Python 3.6 and uses Tensorflow 1.4.1.

Requirements

Install the reqirements via
pip install -r requirements.txt

Note that the modules powerlaw and python-igraph are only needed to compute the graph statistics. If you only want to run NetGAN, feel free to comment out the respective parts of the code.

Run the code

To try our code, the best way to do so is to use the IPython notebook demo.ipynb

Pre-trained models used in the paper

Run graph_generation_pretrained.ipynb and link_prediction_pretrained.ipynb to try our pre-trained models on Cora-ML.

Latent variable interpolation

Run latent_interpolation.ipynb to run latent variable interpolation experiments as in the paper.

Installation

To install the package, run python setup.py install.

Citation

Please cite our paper if you use the model or this code in your own work:

@inproceedings{DBLP:conf/icml/BojchevskiSZG18,
  author    = {Aleksandar Bojchevski and
               Oleksandr Shchur and
               Daniel Z{\"{u}}gner and
               Stephan G{\"{u}}nnemann},
  title     = {NetGAN: Generating Graphs via Random Walks},
  booktitle = {Proceedings of the 35th International Conference on Machine Learning,
               {ICML} 2018, Stockholmsm{\"{a}}ssan, Stockholm, Sweden, July
               10-15, 2018},
  pages     = {609--618},
  year      = {2018},
}

References

Cora dataset

In the data folder you can find the Cora-ML dataset. The raw data was originally published by

McCallum, Andrew Kachites, Nigam, Kamal, Rennie, Jason, and Seymore, Kristie. "Automating the construction of internet portals with machine learning." Information Retrieval, 3(2):127–163, 2000.

and the graph was extracted by

Bojchevski, Aleksandar, and Stephan Günnemann. "Deep gaussian embedding of attributed graphs: Unsupervised inductive learning via ranking." ICLR 2018.

Contact

Please contact [email protected] in case you have any questions.

netgan's People

Contributors

abojchevski avatar danielzuegner avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar  avatar  avatar  avatar  avatar

netgan's Issues

Covariates + Single Graph

I have a custom graph with some covariates, how can I train on these to compare to ERGM? Particularly, what would you recommend for using covariates for netGAN generation?

What is the best way to supply my own single graph to this pipeline with a set of covariates?

How to train the ERGM model mentioned in your paper?

Hi, thanks for your excellent work on graph generation.

I have some problems during the implementation of the baseline method ERGM in your paper. I followed your parameter settings in R, but the simulation results are always bad (such as the explosion of the number of edges).

This is my R code for graph simulation by ERGM:
result.network <- simulate( ergm( input.network ~ edges + degcor + degree1.5 + gwesp + density, control=control.ergm( MCMLE.maxit=20, MCMLE.density.guard=100000, parallel=2, parallel.type="PSOCK" )) )
where 'input.network' is the graph to be simulated, and the function 'simulate' is from package 'ergm'.
I wonder how to have the right hyper-parameters to have the best simulation result like your paper's.

Reproduce

I follow this code to train the results of Graph Generation that can't reproduce your paper. Do you have any other settings?

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.