Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"
☆44Nov 17, 2023Updated 2 years ago
Alternatives and similar repositories for GOT
Users that are interested in GOT are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Code accompanying the AAAI 2022 paper "fGOT: Graph Distances based on Filters and Optimal Transport"☆15Dec 8, 2022Updated 3 years ago
- Code for SGDD☆26Oct 19, 2023Updated 2 years ago
- [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs☆17Dec 22, 2020Updated 5 years ago
- ☆13May 16, 2018Updated 8 years ago
- Code for Optimal Transport for structured data with application on graphs☆107Dec 17, 2022Updated 3 years ago
- Simple, predictable pricing with DigitalOcean hosting • AdAlways know what you'll pay with monthly caps and flat pricing. Enterprise-grade infrastructure trusted by 600k+ customers.
- Locally corrected Nyström (LCN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, …☆19Apr 26, 2023Updated 3 years ago
- Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Apr 9, 2021Updated 5 years ago
- A list of awesome papers and cool resources on optimal transport and its applications in general! As you will notice, this list is curren…☆246May 9, 2021Updated 5 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆77Aug 20, 2019Updated 6 years ago
- Official codebase for paper Disentangled Condensation for Graphs (DisCo). This codebase is based on the open-source Pytorch Geometric fra…☆11Feb 12, 2025Updated last year
- GraphInception code.☆17Jun 28, 2017Updated 8 years ago
- A Tensorflow implementation of the paper https://arxiv.org/pdf/1803.07710.pdf☆14Jun 19, 2019Updated 6 years ago
- Python notebooks for Optimal Transport between Gaussian Mixture Models☆48Apr 24, 2021Updated 5 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆46Sep 15, 2019Updated 6 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Source code of GResNet☆17Sep 16, 2020Updated 5 years ago
- ☆24Sep 10, 2021Updated 4 years ago
- Graph Agglomerative Clustering Library☆23Jul 4, 2019Updated 6 years ago
- Code for GBK-GNN (paper accepted by WWW2022)☆17Jun 16, 2022Updated 4 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆32Nov 1, 2022Updated 3 years ago
- Pytorch implementation of "Entropic Neural Optimal Transport via Diffusion Processes" (NeurIPS 2023, oral).☆43Mar 11, 2024Updated 2 years ago
- Implementation of FedBary☆17Mar 24, 2025Updated last year
- ACMP: Allen-Cahn Message Passing with Attractive and Repulsive Forces for Graph Neural Networks(ICLR 2023)☆22Nov 3, 2023Updated 2 years ago
- ☆16Jul 6, 2023Updated 2 years ago
- End-to-end encrypted email - Proton Mail • AdSpecial offer: 40% Off Yearly / 80% Off First Month. All Proton services are open source and independently audited for security.
- Wasserstein Distance Graph Alignment☆23Feb 9, 2021Updated 5 years ago
- Implementation of Wasserstein adversarial attacks.☆24Jan 2, 2021Updated 5 years ago
- Source code of NeurIPS 2022 paper “Co-Modality Graph Contrastive Learning for Imbalanced Node Classification”☆21Jan 15, 2023Updated 3 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆89Sep 1, 2024Updated last year
- Solver in the low-rank tensor train format with cross approximation approach for the multidimensional Fokker-Planck equation☆14Oct 24, 2023Updated 2 years ago
- ESICCC: A systematic computational framework for evaluation, selection and integration of cell-cell communication inference methods☆13Jan 10, 2024Updated 2 years ago
- Official repo and evaluation implementation of KnowRecall and VisRecall☆10May 22, 2025Updated last year
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆47Mar 13, 2023Updated 3 years ago
- ☆13Mar 26, 2019Updated 7 years ago
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- ☆58Sep 28, 2022Updated 3 years ago
- Code for ICML 2020 "Graph Optimal Transport for Cross-Domain Alignment"☆164Jul 24, 2020Updated 5 years ago
- ☆31Jan 29, 2024Updated 2 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Jun 14, 2019Updated 7 years ago
- Orthogonal Quantile Regression☆11Oct 21, 2021Updated 4 years ago
- Published papers focusing on graph domain adaptation, with survey paper online as Domain Adaptation for Graph Representation Learning: Ch…☆56Apr 23, 2025Updated last year
- ☆13Nov 19, 2020Updated 5 years ago