Alternatives and similar repositories for gwl

Users that are interested in gwl are comparing it to the libraries listed below

• HongtengXu / Relational-Factorization-Model
  Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)
  ☆31Updated 3 years ago
• HongtengXu / s-gwl
  Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
  ☆44Updated 6 years ago
• tvayer / FGW
  Code for Optimal Transport for structured data with application on graphs
  ☆103Updated 2 years ago
• matenure / OTCoarsening
  Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport
  ☆37Updated 4 years ago
• vikasverma1077 / GraphMix
  Code for reproducing results in GraphMix paper
  ☆72Updated 3 years ago
• ermongroup / graphite
  Code for Graphite iterative graph generation
  ☆59Updated 6 years ago
• LingxiaoShawn / PairNorm
  Source code for PairNorm (ICLR 2020)
  ☆79Updated 5 years ago
• se-ok / WLsimilarity
  informal exposition of Weisfeiler-Leman similarity
  ☆28Updated 4 years ago
• KangchengHou / gntk
  Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)
  ☆105Updated 5 years ago
• BorgwardtLab / WWL
  Wasserstein Weisfeiler-Lehman Graph Kernels
  ☆86Updated last year
• HongtengXu / Relational-AutoEncoders
  Learning Autoencoders with Relational Regularization
  ☆46Updated 5 years ago
• bluer555 / KernelGCN
  Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs
  ☆34Updated 5 years ago
• Shen-Lab / SS-GCNs
  [ICML 2020] "When Does Self-Supervision Help Graph Convolutional Networks?" by Yuning You, Tianlong Chen, Zhangyang Wang, Yang Shen
  ☆112Updated 4 years ago
• lchapel / partial-GW-for-PU
  Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…
  ☆20Updated 5 years ago
• KelestZ / CondGen
  Conditional Structure Generation through Graph Variational Generative Adversarial Nets, NeurIPS 2019.
  ☆53Updated 6 years ago
• Hermina / GOT
  Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"
  ☆43Updated 2 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• samihaija / mixhop
  Official Implementation of ICML 2019 Paper. MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing; an…
  ☆125Updated 6 years ago
• claying / GCKN
  Pytorch Implementation of Graph Convolutional Kernel Networks
  ☆54Updated 3 years ago
• PurdueMINDS / RelationalPooling
  ☆35Updated 6 years ago
• chentingpc / gfn
  Code for "Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification"
  ☆53Updated 5 years ago
• nimadehmamy / Understanding-GCN
  code for the paper in NeurIPS 2019
  ☆40Updated 2 years ago
• sigvae / SIGraphVAE
  ☆26Updated 6 years ago
• lucfra / LDS-GNN
  Learning Discrete Structures for Graph Neural Networks (TensorFlow implementation)
  ☆199Updated last year
• zpeng27 / GMI
  Graph Representation Learning via Graphical Mutual Information Maximization
  ☆118Updated 5 years ago
• leowyy / GraphTSNE
  PyTorch Implementation of GraphTSNE, ICLR’19
  ☆137Updated 6 years ago
• SwiftieH / IGNN
  Implicit Graph Neural Networks
  ☆64Updated 4 years ago
• AaltoPML / Rethinking-pooling-in-GNNs
  ☆62Updated 5 years ago
• PurdueMINDS / Equivalence
  Equivalence Between Structural Representations and Positional Node Embeddings
  ☆22Updated 5 years ago
• tvayer / SGW
  Code for Sliced Gromov-Wasserstein
  ☆69Updated 6 years ago