Hermina / GOT
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
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆42Updated 5 years ago
- Code for Online Graph Dictionary Learning☆15Updated 3 years ago
- ☆62Updated 4 years ago
- ☆27Updated 3 years ago
- Official implementation for the paper: Permutation Invariant Graph Generation via Score-Based Generative Modeling☆110Updated last year
- Graph Posterior Network: Bayesian Predictive Uncertainty for Node Classification (NeurIPS 2021)☆42Updated 2 years ago
- Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport☆36Updated 4 years ago
- Learning Graphons via Structured Gromov-Wasserstein Barycenters☆22Updated 4 years ago
- The implementation of our NeurIPS 2020 paper "Graph Geometry Interaction Learning" (GIL)☆45Updated 4 years ago
- ☆46Updated 3 years ago
- Code accompanying the AAAI 2022 paper "fGOT: Graph Distances based on Filters and Optimal Transport"☆15Updated 2 years ago
- Code for "Explainability methods for graph convolutional neural networks" - PE Pope*, S Kolouri*, M Rostami, CE Martin, H Hoffmann (CVPR …☆34Updated last month
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 2 years ago
- Code for "Random Features Strengthen Graph Neural Networks" (SDM 2021)☆22Updated 4 years ago
- ☆53Updated 2 years ago
- Variational Graph Convolutional Networks☆22Updated 4 years ago
- Code for Optimal Transport for structured data with application on graphs☆98Updated 2 years ago
- ☆25Updated 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
- The code for the ICML 2021 paper "Graph Neural Networks Inspired by Classical Iterative Algorithms".☆43Updated 3 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆81Updated 7 months ago
- Source code for PairNorm (ICLR 2020)☆76Updated 5 years ago
- The PyTorch implementation of Directed Graph Contrastive Learning (DiGCL), NeurIPS-2021☆36Updated 3 years ago
- Official Code of Decoupled Graph Convolution (DGC)☆16Updated 3 years ago
- ☆21Updated 3 years ago
- Code and dataset to test empirically the expressive power of graph pooling operators presented as presented at NeurIPS 2023☆37Updated last year
- Gradient gating (ICLR 2023)☆53Updated last year
- PyTorch implementation of Pseudo-Riemannian Graph Convolutional Networks (NeurIPS'22))☆16Updated 9 months ago
- Random Walk Graph Neural Networks☆53Updated 4 years ago