Alternatives and similar repositories for TreeWasserstein

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

• 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.
  ☆73Updated 8 years ago
• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆36Updated 5 years ago
• trneedham / gromov-wasserstein-statistics
  Statistics on the space of asymmetric networks via Gromov-Wasserstein distance
  ☆13Updated 5 years ago
• c-hofer / nips2017
  Deprecated repository for "Deep Learning with Topological Signatures"
  ☆36Updated 5 years ago
• HongtengXu / gwl
  Gromov-Wasserstein Learning for Graph Matching and Node Embedding
  ☆72Updated 5 years ago
• c-hofer / tda-toolkit
  My persistent homology related code.
  ☆26Updated 5 years ago
• vermaMachineLearning / FGSD
  Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).
  ☆24Updated 5 years ago
• mblondel / smooth-ot
  Python implementation of smooth optimal transport.
  ☆59Updated 4 years ago
• horacepan / MLGkernel
  Implementation of the Multiscale Laplacian Graph Kernel
  ☆19Updated 5 years ago
• tvayer / FGW
  Code for Optimal Transport for structured data with application on graphs
  ☆101Updated 2 years ago
• BorgwardtLab / graph-kernels
  Graph kernels
  ☆56Updated 3 years ago
• icemiliang / pyvot
  A Python implementation of Monge optimal transportation
  ☆49Updated last year
• 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
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• wittawatj / interpretable-test
  NeurIPS 2016. Linear-time interpretable nonparametric two-sample test.
  ☆64Updated 7 years ago
• arolet / wasserstein-dictionary-learning
  A matlab toolbox to perform Wasserstein Dictionary Learning or NMF
  ☆32Updated 9 years ago
• hhcho / hyplinear
  MATLAB implementation of linear support vector classification in hyperbolic space
  ☆20Updated 7 years ago
• ermongroup / graphite
  Code for Graphite iterative graph generation
  ☆59Updated 6 years ago
• LJeub / LocalCommunities
  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
• KangchengHou / gntk
  Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)
  ☆104Updated 5 years ago
• dimkal89 / rvae
  ☆38Updated 5 years ago
• blei-lab / ars-reparameterization
  Source code for Naesseth et. al. "Reparameterization Gradients through Acceptance-Rejection Sampling Algorithms" (2017)
  ☆39Updated 8 years ago
• cnmusco / graph-similarity-learning
  Algorithms for learning network structure from effective resistances and other random-walk-based similarities.
  ☆31Updated 7 years ago
• bunnech / gwgan
  Learning Generative Models across Incomparable Spaces (ICML 2019)
  ☆27Updated 5 years ago
• mrkulk / SequentialInference
  Dirichlet Process Mixture using PVI, SMC, Variational
  ☆15Updated 11 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
  ☆61Updated 4 years ago