Alternatives and similar repositories for Generative-Graph-Convolutional-Network-for-Growing-Graphs:

Users that are interested in Generative-Graph-Convolutional-Network-for-Growing-Graphs are comparing it to the libraries listed below

• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆35Updated 4 years ago
• hongyuanmei / nce-mpp
  Source code for Noise-Contrastive Estimation for Multivariate Point Processes (NeurIPS 2020).
  ☆15Updated 4 years ago
• ebonilla / VGCN
  Variational Graph Convolutional Networks
  ☆22Updated 4 years ago
• giannisnik / message_passing_graph_kernels
  ☆16Updated 4 years ago
• HongtengXu / Relational-Factorization-Model
  Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)
  ☆31Updated 2 years ago
• shchur / triangular-tpp
  Implementation of "Fast and Flexible Temporal Point Processes with Triangular Maps" (Oral @ NeurIPS 2020)
  ☆23Updated last year
• matenure / OTCoarsening
  Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport
  ☆36Updated 3 years ago
• 000Justin000 / gnn-residual-correlation
  ☆20Updated 3 years ago
• abojchevski / paican
  Implementation of "Bayesian Robust Attributed Graph Clustering: Joint Learning of Partial Anomalies and Group Structure".
  ☆24Updated 4 years ago
• Matrix-Factorization-Bandit / IMFB-KDD2019
  Code for the experiments of Matrix Factorization Bandit
  ☆24Updated 6 years ago
• nikhil-dce / SBM-meet-GNN
  Implementation of SBM-meet-GNN
  ☆22Updated 5 years ago
• CheriseZhu / GSSNN
  The implementation of our AAAI 2020 paper "GSSNN: Graph Smoothing Splines Neural Network".
  ☆20Updated 4 years ago
• flyingtango / DiGCL
  The PyTorch implementation of Directed Graph Contrastive Learning (DiGCL), NeurIPS-2021
  ☆36Updated 3 years ago
• tailintalent / causal
  Discovering directional relations via minimum predictive information regularization
  ☆23Updated 5 years ago
• bluer555 / KernelGCN
  Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs
  ☆34Updated 5 years ago
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆26Updated 2 years ago
• PurdueMINDS / RelationalPooling
  ☆35Updated 5 years ago
• hanliu95 / DFM
  Discrete Factorization Machines
  ☆10Updated 6 years ago
• shuaiOKshuai / D2AGE
  The source codes for D2AGE model. Distance-aware DAG Embedding for Proximity Search on Heterogeneous Graphs.
  ☆12Updated 7 years ago
• StatsDLMathsRecomSys / Self-attention-with-Functional-Time-Representation-Learning
  ☆50Updated last year
• muhanzhang / HyperLinkPrediction
  Code for "M. Zhang, Z. Cui, S. Jiang, and Y. Chen, Beyond Link Prediction: Predicting Hyperlinks in Adjacency Space, AAAI-2018".
  ☆21Updated 6 years ago
• nkeriven / random-graph-gnn
  ☆12Updated 3 years ago
• HongtengXu / s-gwl
  Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
  ☆42Updated 5 years ago
• karl-zhao / benchmarking-gnns-pyg
  ☆30Updated last year
• nimadehmamy / Understanding-GCN
  code for the paper in NeurIPS 2019
  ☆40Updated last year
• RingBDStack / dynamic_network_embedding
  ☆12Updated 6 years ago
• delta2323 / gnn-asymptotics
  Code for Graph Neural Networks Exponentially Lose Expressive Power for Node Classification.
  ☆30Updated 4 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆32Updated 4 years ago
• ermongroup / graphite
  Code for Graphite iterative graph generation
  ☆59Updated 5 years ago