trneedham / Spectral-Gromov-WassersteinLinks
Graph matching and clustering by comparing heat kernels via optimal transport.
☆27Updated 3 years ago
Alternatives and similar repositories for Spectral-Gromov-Wasserstein
Users that are interested in Spectral-Gromov-Wasserstein are comparing it to the libraries listed below
Sorting:
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 5 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆37Updated 5 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 3 years ago
- CO-Optimal Transport☆42Updated 5 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Updated 6 years ago
- Embedding graphs in symmetric spaces☆30Updated 4 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆44Updated 6 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆45Updated 2 years ago
- Code for Optimal Transport for structured data with application on graphs☆104Updated 3 years ago
- ☆12Updated 4 years ago
- Official implementation of Joint Multidimensional Scaling