Alternatives and similar repositories for TreeWasserstein

Users that are interested in TreeWasserstein are comparing it to the libraries listed below

• trneedham / gromov-wasserstein-statistics
  Statistics on the space of asymmetric networks via Gromov-Wasserstein distance
  ☆13Updated 5 years ago
• fedelopez77 / gyrospd
  GyroSPD: Vector-valued Distance and Gyrocalculus on the Space of Symmetric Positive Definite Matrices
  ☆18Updated 3 years ago
• gpeyre / 2016-ICML-gromov-wasserstein
  Gabriel Peyré, Marco Cuturi, Justin Solomon, Gromov-Wasserstein Averaging of Kernel and Distance Matrices, Proc. of ICML 2016.
  ☆74Updated 9 years ago
• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆37Updated 5 years ago
• HongtengXu / gwl
  Gromov-Wasserstein Learning for Graph Matching and Node Embedding
  ☆72Updated 6 years ago
• vermaMachineLearning / FGSD
  Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).
  ☆24Updated 5 years ago
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆27Updated 2 years ago
• tvayer / FGW
  Code for Optimal Transport for structured data with application on graphs
  ☆102Updated 2 years ago
• horacepan / MLGkernel
  Implementation of the Multiscale Laplacian Graph Kernel
  ☆19Updated 5 years ago
• mblondel / smooth-ot
  Python implementation of smooth optimal transport.
  ☆60Updated 4 years ago
• tvayer / SGW
  Code for Sliced Gromov-Wasserstein
  ☆69Updated 5 years ago
• BorgwardtLab / Neural-Persistence
  Code for the paper 'Neural Persistence: A Complexity Measure for Deep Neural Networks Using Algebraic Topology'
  ☆30Updated 6 years ago
• thibsej / unbalanced_gromov_wasserstein
  Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport
  ☆45Updated 2 years ago
• HongtengXu / s-gwl
  Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
  ☆44Updated 6 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• talwagner / efficient_kde
  Efficient LSH-based kernel density estimation
  ☆29Updated 5 years ago
• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆29Updated 6 years ago
• BorgwardtLab / P-WL
  A Persistent Weisfeiler–Lehman Procedure for Graph Classification
  ☆63Updated 4 years ago
• c-hofer / nips2017
  Deprecated repository for "Deep Learning with Topological Signatures"
  ☆36Updated 5 years ago
• icemiliang / pyvot
  A Python implementation of Monge optimal transportation
  ☆49Updated 2 years ago
• EigenPro / EigenPro2
  EigenPro2 iteration in Tensorflow (Keras)
  ☆23Updated 6 years ago
• bunnech / gwgan
  Learning Generative Models across Incomparable Spaces (ICML 2019)
  ☆27Updated 5 years ago
• giannisnik / repset
  Rep the Set: Neural Networks for Learning Set Representations
  ☆29Updated 5 years ago
• ermongroup / graphite
  Code for Graphite iterative graph generation
  ☆59Updated 6 years ago
• MathieuCarriere / difftda
  Persistence differentiation with Gudhi and Tensorflow
  ☆19Updated 2 years ago
• jeanfeydy / global-divergences
  MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.
  ☆56Updated 6 years ago
• hhcho / hyplinear
  MATLAB implementation of linear support vector classification in hyperbolic space
  ☆20Updated 7 years ago
• xiaoshuai09 / Wasserstein-Learning-For-Point-Process
  learning point processes by means of optimal transport and wasserstein distance
  ☆54Updated 7 years ago
• mducoffe / Learning-Wasserstein-Embeddings
  Keras implementation of Deep Wasserstein Embeddings
  ☆48Updated 7 years ago
• GiulsLu / OT-gradients
  ☆12Updated 6 years ago