HongtengXu / s-gwl
Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
☆42Updated 5 years ago
Alternatives and similar repositories for s-gwl:
Users that are interested in s-gwl are comparing it to the libraries listed below
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆34Updated 4 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Updated 2 years ago
- Code for Optimal Transport for structured data with application on graphs☆98Updated 2 years ago
- ☆27Updated 3 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 2 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆41Updated last year
- Wasserstein Weisfeiler-Lehman Graph Kernels☆81Updated 6 months ago
- Code for Online Graph Dictionary Learning☆15Updated 3 years ago
- Variational Graph Convolutional Networks☆22Updated 4 years ago
- "Shift-Robust GNNs: Overcoming the Limitations of Localized Graph Training Data" (NeurIPS 21')☆47Updated 2 years ago
- Code for the ICLR 2019 paper "Invariant and Equiovariant Graph Networks"☆24Updated 4 years ago
- Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport☆36Updated 4 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆35Updated 4 years ago
- Pytorch Implementation of Graph Convolutional Kernel Networks☆54Updated 2 years ago
- ☆38Updated 2 years ago
- Code for "Weisfeiler and Leman go sparse: Towards higher-order graph embeddings"☆22Updated 3 years ago
- Code for Graphite iterative graph generation☆59Updated 5 years ago
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆16Updated 4 years ago
- ☆30Updated last year
- Size-Invariant Graph Representations for Graph Classification Extrapolations (ICML 2021 Long Talk)☆23Updated 2 years ago
- The code for the ICML 2021 paper "Graph Neural Networks Inspired by Classical Iterative Algorithms".☆43Updated 3 years ago
- Official implementation of the ICML2021 paper "Elastic Graph Neural Networks"☆41Updated 3 years ago
- PyTorch implementation of BGRL (https://arxiv.org/abs/2102.06514)☆81Updated last year
- A PyTorch implementation of "SelfGNN: Self-supervised Graph Neural Networks without explicit negative sampling" paper, which appeared in …☆30Updated 3 years ago
- ☆24Updated 3 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆44Updated 2 years ago
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆61Updated 3 years ago
- The PyTorch implementation of Directed Graph Contrastive Learning (DiGCL), NeurIPS-2021☆36Updated 3 years ago
- Official code for the ICML 2021 paper "Generative Causal Explanations for Graph Neural Networks."☆66Updated 2 years ago