HongtengXu / s-gwl
Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
☆40Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for s-gwl
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆71Updated 5 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆30Updated 3 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆38Updated last year
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆30Updated 2 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆23Updated last year
- Wasserstein Weisfeiler-Lehman Graph Kernels☆78Updated 2 months ago
- Code for Online Graph Dictionary Learning☆15Updated 2 years ago
- ☆26Updated 3 years ago
- Code for Graphite iterative graph generation☆59Updated 5 years ago
- Official code for the ICML 2021 paper "Generative Causal Explanations for Graph Neural Networks."☆65Updated 2 years ago
- Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport☆36Updated 3 years ago
- Code for Optimal Transport for structured data with application on graphs☆98Updated last year
- Code for the ICLR 2019 paper "Invariant and Equiovariant Graph Networks"☆23Updated 4 years ago
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆15Updated 4 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
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆35Updated 4 years ago
- PyTorch code of "SLAPS: Self-Supervision Improves Structure Learning for Graph Neural Networks"☆86Updated 3 years ago
- ☆25Updated 5 years ago
- ☆25Updated 3 years ago
- The code for the ICML 2021 paper "Graph Neural Networks Inspired by Classical Iterative Algorithms".☆43Updated 3 years ago
- A PyTorch implementation of "SelfGNN: Self-supervised Graph Neural Networks without explicit negative sampling" paper, which appeared in …☆29Updated 2 years ago
- Code for "Weisfeiler and Leman go sparse: Towards higher-order graph embeddings"☆22Updated 2 years ago
- ☆62Updated 4 years ago
- ☆24Updated 3 years ago
- Pytorch Implementation of Graph Convolutional Kernel Networks☆54Updated last year
- Conditional Structure Generation through Graph Variational Generative Adversarial Nets, NeurIPS 2019.☆54Updated 5 years ago
- ☆35Updated 5 years ago
- GraphFramEx: a systematic evaluation framework for explainability methods on GNNs☆37Updated 7 months ago
- Locally corrected Nyström (LCN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, …☆17Updated last year