Alternatives and similar repositories for TreeRep

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

• HazyResearch / HoroPCA
  Hyperbolic PCA via Horospherical Projections
  ☆74Updated 2 years ago
• HazyResearch / HypHC
  Hyperbolic Hierarchical Clustering.
  ☆206Updated 2 years ago
• emilemathieu / pvae
  code for "Continuous Hierarchical Representations with Poincaré Variational Auto-Encoders".
  ☆129Updated 2 years ago
• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆37Updated 5 years ago
• drewwilimitis / hyperbolic-learning
  Implemented Machine Learning Algorithms in Hyperbolic Geometry (MDS, K-Means, Support vector machines, etc.)
  ☆143Updated 5 years ago
• 000Justin000 / gnn-residual-correlation
  ☆20Updated 4 years ago
• crisbodnar / dgm
  Deep Graph Mapper: Seeing Graphs through the Neural Lens
  ☆58Updated 2 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• KangchengHou / gntk
  Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)
  ☆105Updated 5 years ago
• spbu-math-cs / Graph-Gaussian-Processes
  Supplementary code for the AISTATS 2021 paper "Matern Gaussian Processes on Graphs".
  ☆53Updated last month
• dicai / pygraphon
  Python library for working with graphons
  ☆23Updated 8 years ago
• eltrompetero / coniii
  Convenient Interface to Inverse Ising (ConIII)
  ☆21Updated 2 months ago
• theSage21 / lorentz-embeddings
  Embed arbitrary graphs in Hyperbolic space
  ☆77Updated 3 years ago
• hhcho / hyplinear
  MATLAB implementation of linear support vector classification in hyperbolic space
  ☆20Updated 7 years ago
• chingyaoc / TMD
  NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks
  ☆37Updated 2 years ago
• leotrs / sunbeam
  SuNBEaM, (s)pectral (n)on-(b)acktracking (e)igenvalue pseudo-(m)etric, a topological graph distance
  ☆16Updated 5 years ago
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆27Updated 3 years ago
• mblondel / smooth-ot
  Python implementation of smooth optimal transport.
  ☆61Updated 4 years ago
• melifluos / Hyperbolic-Embedding
  Learning neural network embeddings in hyperbolic spaces
  ☆14Updated 6 years ago
• PurdueMINDS / Equivalence
  Equivalence Between Structural Representations and Positional Node Embeddings
  ☆22Updated 5 years ago
• ydtydr / HyperbolicTiling_Learning
  Official implementation (learning part) for paper: Numerically Accurate Hyperbolic Embeddings Using Tiling-Based Models
  ☆18Updated last year
• nkeriven / random-graph-gnn
  ☆12Updated 4 years ago
• BorgwardtLab / filtration_curves
  Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'
  ☆18Updated 2 years ago
• joeybose / HyperbolicNF
  ICML 2020 Paper: Latent Variable Modelling with Hyperbolic Normalizing Flows
  ☆54Updated 3 years ago
• jacobdeasy / geometric-js
  ☆18Updated 4 years ago
• stefaniaebli / simplicial_neural_networks
  Simplicial neural networks (SNNs), a generalization of graph neural networks to data that live on a class of topological spaces called si…
  ☆81Updated 4 years ago
• hadarser / SetToGraphPaper
  SetToGraph paper repository
  ☆22Updated 5 years ago
• BorgwardtLab / WWL
  Wasserstein Weisfeiler-Lehman Graph Kernels
  ☆86Updated last year
• bluer555 / KernelGCN
  Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs
  ☆34Updated 5 years ago
• HongtengXu / s-gwl
  Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
  ☆44Updated 6 years ago