HongtengXu / gwlView external linksLinks
Gromov-Wasserstein Learning for Graph Matching and Node Embedding
☆73Aug 20, 2019Updated 6 years ago
Alternatives and similar repositories for gwl
Users that are interested in gwl are comparing it to the libraries listed below
Sorting:
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆44Sep 15, 2019Updated 6 years ago
- Gromov-Wasserstein Alignment of Embeddings☆68Sep 23, 2021Updated 4 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Nov 1, 2022Updated 3 years ago
- Code for Sliced Gromov-Wasserstein☆69Dec 2, 2019Updated 6 years ago
- Gabriel Peyré, Marco Cuturi, Justin Solomon, Gromov-Wasserstein Averaging of Kernel and Distance Matrices, Proc. of ICML 2016.☆75Aug 21, 2016Updated 9 years ago
- Locally corrected Nyström (LCN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, …☆19Apr 26, 2023Updated 2 years ago
- Code accompanying the AAAI 2022 paper "fGOT: Graph Distances based on Filters and Optimal Transport"☆15Dec 8, 2022Updated 3 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆15Jun 13, 2020Updated 5 years ago
- Code for Optimal Transport for structured data with application on graphs☆104Dec 17, 2022Updated 3 years ago
- [PAKDD2023] Improving Knowledge Graph Entity Alignment with Graph Augmentation☆11Nov 16, 2023Updated 2 years ago
- ☆20Apr 25, 2021Updated 4 years ago
- Official implementation of Joint Multidimensional Scaling☆24Nov 19, 2023Updated 2 years ago
- ☆19Mar 3, 2025Updated 11 months ago
- Gromov-Wasserstein based optimal transport for aligning single-cell multi-omics data☆78Jan 25, 2024Updated 2 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Jan 22, 2021Updated 5 years ago
- Implementation of the Gumbel-Sigmoid distribution in PyTorch.☆21Jul 22, 2022Updated 3 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆45Mar 13, 2023Updated 2 years ago
- implements optimal transport algorithms in pytorch☆104May 15, 2022Updated 3 years ago
- Reimplementation of Wasserstein Auto Encoder (WAE) with Wasserstein GAN based penalty D_Z in Tensorflow☆12Mar 28, 2019Updated 6 years ago
- ☆12May 31, 2021Updated 4 years ago
- Multi-Graph Multi-Label Learning☆11May 30, 2018Updated 7 years ago
- Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Apr 9, 2021Updated 4 years ago
- ☆13Mar 26, 2019Updated 6 years ago
- ☆16Oct 22, 2020Updated 5 years ago
- ☆14Apr 16, 2024Updated last year
- ☆12Dec 1, 2020Updated 5 years ago
- single-cell RNA-seq clustering☆10Sep 14, 2020Updated 5 years ago
- A toolbox for sparse contrastive principal component analysis☆12Feb 10, 2025Updated last year
- ☆12Jan 29, 2022Updated 4 years ago
- ☆13May 16, 2018Updated 7 years ago
- C++ library for graph kernel and edit distance algorithm☆15Sep 4, 2018Updated 7 years ago
- Graph transport network (GTN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, an…☆15Apr 26, 2023Updated 2 years ago
- Representation learning-based graph alignment based on implicit matrix factorization and structural embeddings☆97Mar 30, 2021Updated 4 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Jun 14, 2019Updated 6 years ago
- code submission to NeurIPS2019☆13Aug 9, 2023Updated 2 years ago
- A graph matching library for Python☆208Apr 25, 2024Updated last year
- POT : Python Optimal Transport☆2,744Updated this week
- ☆11Feb 18, 2019Updated 6 years ago
- codes accompanying ACL 2019 paper Graph Neural Networks with Generated Parameters for Relation Extraction☆13Jul 26, 2019Updated 6 years ago