Hermina / GOTLinks
Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"
☆41Updated last year
Alternatives and similar repositories for GOT
Users that are interested in GOT are comparing it to the libraries listed below
Sorting:
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 2 years ago
- Code for Optimal Transport for structured data with application on graphs☆100Updated 2 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆43Updated 5 years ago
- Graph Posterior Network: Bayesian Predictive Uncertainty for Node Classification (NeurIPS 2021)☆43Updated 2 years ago
- Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport☆36Updated 4 years ago
- Code for Online Graph Dictionary Learning☆17Updated 3 years ago
- Pytorch Implementation of Graph Convolutional Kernel Networks☆54Updated 2 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- ☆25Updated 5 years ago
- Code accompanying the AAAI 2022 paper "fGOT: Graph Distances based on Filters and Optimal Transport"☆15Updated 2 years ago
- ☆28Updated 3 years ago
- [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs☆16Updated 4 years ago
- Code for the ICLR 2019 paper "Invariant and Equiovariant Graph Networks"☆24Updated 5 years ago
- Code of "Analyzing the Expressive Power of Graph Neural Networks in a Spectral Perspective" paper published in ICLR2021☆46Updated 3 years ago
- Official implementation for the paper: Permutation Invariant Graph Generation via Score-Based Generative Modeling☆110Updated last year
- ☆47Updated 3 years ago
- Learning Autoencoders with Relational Regularization☆46Updated 4 years ago
- Uncertainty Aware Semi-Supervised Learning on Graph Data☆40Updated 4 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆81Updated 9 months ago
- The PyTorch implementation of Directed Graph Contrastive Learning (DiGCL), NeurIPS-2021☆35Updated 3 years ago
- ☆62Updated 4 years ago
- Code for "Explainability methods for graph convolutional neural networks" - PE Pope*, S Kolouri*, M Rostami, CE Martin, H Hoffmann (CVPR …☆34Updated 2 months ago
- "Shift-Robust GNNs: Overcoming the Limitations of Localized Graph Training Data" (NeurIPS 21')☆48Updated 3 years ago
- The code for the ICML 2021 paper "Graph Neural Networks Inspired by Classical Iterative Algorithms".☆43Updated 3 years ago
- ☆20Updated 4 years ago
- Learning Graphons via Structured Gromov-Wasserstein Barycenters☆22Updated 4 years ago
- ☆28Updated last year
- Variational Graph Convolutional Networks☆23Updated 4 years ago
- Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…☆21Updated 5 years ago