lttam / TreeWassersteinLinks
Matlab code for tree-Wasserstein distance in the paper "Tree-Sliced Variants of Wasserstein Distances", NeurIPS, 2019. (Tam Le, Makoto Yamada, Kenji Fukumizu, Marco Cuturi) --- A valid positive definite Wasserstein kernel for persistence diagrams: exp(-TW/t)
☆11Updated 5 years ago
Alternatives and similar repositories for TreeWasserstein
Users that are interested in TreeWasserstein are comparing it to the libraries listed below
Sorting:
- GyroSPD: Vector-valued Distance and Gyrocalculus on the Space of Symmetric Positive Definite Matrices☆18Updated 3 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆13Updated 5 years ago
- Gabriel Peyré, Marco Cuturi, Justin Solomon, Gromov-Wasserstein Averaging of Kernel and Distance Matrices, Proc. of ICML 2016.☆73Updated 8 years ago
- Implementation of the Multiscale Laplacian Graph Kernel☆19Updated 5 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆36Updated 5 years ago
- A matlab toolbox to perform Wasserstein Dictionary Learning or NMF☆32Updated 9 years ago
- My persistent homology related code.☆26Updated 5 years ago
- Python implementation of smooth optimal transport.☆59Updated 4 years ago
- Local community detection code that implements the methods used in Think Locally, Act Locally: The Detection of Small, Medium-Sized, and …☆13Updated 7 years ago
- Algorithms for learning network structure from effective resistances and other random-walk-based similarities.☆31Updated 7 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- Graph kernels☆56Updated 3 years ago
- Deprecated repository for "Deep Learning with Topological Signatures"☆36Updated 5 years ago
- ☆12Updated last year
- Morgan A. Schmitz., Matthieu Heitz, Nicolas Bonneel, Fred Ngole, David Coeurjolly, Marco Cuturi, Gabriel Peyré, and Jean-Luc Starck. "Was…☆20Updated 5 years ago
- Code for Optimal Transport for structured data with application on graphs☆101Updated 2 years ago
- EigenPro2 iteration in Tensorflow (Keras)☆23Updated 6 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Persistence differentiation with Gudhi and Tensorflow☆18Updated last year
- ☆16Updated 5 years ago
- simple MATLAB code for randomized matrix computation☆23Updated 9 years ago
- ☆21Updated 2 years ago
- Dirichlet Process Mixture using PVI, SMC, Variational☆15Updated 11 years ago
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆61Updated 4 years ago
- Keras implementation of Deep Wasserstein Embeddings☆48Updated 7 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Updated 6 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆27Updated 2 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆44Updated 5 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆45Updated 2 years ago
- Efficient LSH-based kernel density estimation☆29Updated 5 years ago