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
  ☆73Updated 2 years ago
• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆37Updated 5 years ago
• HazyResearch / HypHC
  Hyperbolic Hierarchical Clustering.
  ☆205Updated 2 years ago
• emilemathieu / pvae
  code for "Continuous Hierarchical Representations with Poincaré Variational Auto-Encoders".
  ☆129Updated 2 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
• spbu-math-cs / Graph-Gaussian-Processes
  Supplementary code for the AISTATS 2021 paper "Matern Gaussian Processes on Graphs".
  ☆53Updated 8 months ago
• dicai / pygraphon
  Python library for working with graphons
  ☆23Updated 8 years ago
• drewwilimitis / hyperbolic-learning
  Implemented Machine Learning Algorithms in Hyperbolic Geometry (MDS, K-Means, Support vector machines, etc.)
  ☆140Updated 5 years ago
• 000Justin000 / gnn-residual-correlation
  ☆20Updated 4 years ago
• dwright37 / lorentz_embeddings_recreation
  A recreation of the Lorentz embeddings paper from ICML 2018 (Nickel 2018)
  ☆20Updated 6 years ago
• KangchengHou / gntk
  Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)
  ☆104Updated 5 years ago
• ydtydr / HyperbolicTiling_Learning
  Official implementation (learning part) for paper: Numerically Accurate Hyperbolic Embeddings Using Tiling-Based Models
  ☆18Updated last year
• chingyaoc / TMD
  NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks
  ☆37Updated 2 years ago
• mblondel / smooth-ot
  Python implementation of smooth optimal transport.
  ☆60Updated 4 years ago
• theSage21 / lorentz-embeddings
  Embed arbitrary graphs in Hyperbolic space
  ☆76Updated 3 years ago
• nkeriven / random-graph-gnn
  ☆12Updated 4 years ago
• bluer555 / KernelGCN
  Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs
  ☆34Updated 5 years ago
• qiangsiwei / poincare_embedding
  Poincaré Embedding
  ☆40Updated 7 years ago
• HongtengXu / s-gwl
  Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
  ☆44Updated 6 years ago
• leotrs / sunbeam
  SuNBEaM, (s)pectral (n)on-(b)acktracking (e)igenvalue pseudo-(m)etric, a topological graph distance
  ☆16Updated 5 years ago
• NNReasoning / What-Can-Neural-Networks-Reason-About
  ☆44Updated 5 years ago
• jacobdeasy / geometric-js
  ☆17Updated 4 years ago
• PurdueMINDS / Equivalence
  Equivalence Between Structural Representations and Positional Node Embeddings
  ☆22Updated 5 years ago
• OATML / ucate
  Uncertainty in Conditional Average Treatment Effect Estimation
  ☆33Updated 4 years ago
• 000Justin000 / ssl_edge
  Code for "Graph-based Semi-Supervised & Active Learning for Edge Flows"
  ☆15Updated 6 years ago
• BorgwardtLab / WWL
  Wasserstein Weisfeiler-Lehman Graph Kernels
  ☆85Updated last year
• HongtengXu / Relational-Factorization-Model
  Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)
  ☆31Updated 2 years ago
• SwiftieH / IGNN
  Implicit Graph Neural Networks
  ☆64Updated 3 years ago
• gasteigerjo / lcn
  Locally corrected Nyström (LCN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, …
  ☆19Updated 2 years ago