Alternatives and similar repositories for graph-scattering-transforms

Users that are interested in graph-scattering-transforms are comparing it to the libraries listed below

• tvayer / FGW
  Code for Optimal Transport for structured data with application on graphs
  ☆103Updated 2 years ago
• jliu / graph-normalizing-flows
  Code for Graph Normalizing Flows.
  ☆63Updated 6 years ago
• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆37Updated 5 years ago
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆27Updated 2 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• claying / GCKN
  Pytorch Implementation of Graph Convolutional Kernel Networks
  ☆54Updated 2 years ago
• dms-net / scatteringGCN
  Scattering GCN: overcoming oversmoothness in graph convolutional networks
  ☆25Updated 3 years ago
• TheGravLab / A-Unifying-Framework-for-Spectrum-Preserving-Graph-Sparsification-and-Coarsening
  Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)
  ☆16Updated 5 years ago
• tk-rusch / GraphCON
  GraphCON (ICML 2022)
  ☆59Updated 3 years ago
• thibsej / unbalanced_gromov_wasserstein
  Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport
  ☆45Updated 2 years ago
• BorgwardtLab / topological-autoencoders
  Code for the paper "Topological Autoencoders" by Michael Moor, Max Horn, Bastian Rieck, and Karsten Borgwardt.
  ☆151Updated 3 years ago
• mdeff / pygsp_tutorial_graphsip
  Graph signal processing tutorial, presented at the GraphSiP summer school.
  ☆78Updated 6 years ago
• j-zarka / SparseScatNet
  Code implementation of paper: Deep Network Classification by Scattering and Homotopy Dictionary Learning
  ☆25Updated 4 years ago
• trneedham / gromov-wasserstein-statistics
  Statistics on the space of asymmetric networks via Gromov-Wasserstein distance
  ☆15Updated 5 years ago
• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆29Updated 6 years ago
• BorgwardtLab / WWL
  Wasserstein Weisfeiler-Lehman Graph Kernels
  ☆86Updated last year
• chrsmrrs / sparsewl
  Code for "Weisfeiler and Leman go sparse: Towards higher-order graph embeddings"
  ☆22Updated 3 years ago
• c-hofer / graph_filtration_learning
  ☆22Updated 4 years ago
• Hermina / GOT
  Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"
  ☆43Updated 2 years ago
• dimkal89 / rvae
  ☆37Updated 5 years ago
• BorgwardtLab / JointMDS
  Official implementation of Joint Multidimensional Scaling
  ☆23Updated 2 years ago
• matthew-hirn / geo-scattering-graph-data
  Code repository for the paper "Geometric Scattering for Graph Data Analysis"
  ☆13Updated 6 years ago
• HongtengXu / Relational-AutoEncoders
  Learning Autoencoders with Relational Regularization
  ☆46Updated 5 years ago
• HongtengXu / s-gwl
  Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
  ☆44Updated 6 years ago
• cvignac / SMP
  ☆30Updated 4 years ago
• KrishnaswamyLab / DiffusionEMD
  Code corresponding to the paper Diffusion Earth Mover's Distance and Distribution Embeddings
  ☆38Updated last year
• BorisMuzellec / MissingDataOT
  A Pytorch implementation of missing data imputation using optimal transport.
  ☆104Updated 4 years ago
• HongtengXu / gwl
  Gromov-Wasserstein Learning for Graph Matching and Node Embedding
  ☆73Updated 6 years ago
• Zymrael / gde
  Neural Graph Differential Equations (Neural GDEs)
  ☆210Updated 4 years ago
• vivienseguy / Large-Scale-OT
  Stochastic algorithms for computing Regularized Optimal Transport
  ☆58Updated 7 years ago