rsonthal / TreeRepLinks
Learning Tree structures and Tree metrics
☆23Updated last year
Alternatives and similar repositories for TreeRep
Users that are interested in TreeRep are comparing it to the libraries listed below
Sorting:
- Hyperbolic PCA via Horospherical Projections☆73Updated 2 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆37Updated 5 years ago
- Hyperbolic Hierarchical Clustering.☆205Updated 2 years ago
- code for "Continuous Hierarchical Representations with Poincaré Variational Auto-Encoders".☆129Updated 2 years ago
- Deep Graph Mapper: Seeing Graphs through the Neural Lens☆58Updated 2 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Supplementary code for the AISTATS 2021 paper "Matern Gaussian Processes on Graphs".☆53Updated 8 months ago
- Python library for working with graphons☆23Updated 8 years ago
- Implemented Machine Learning Algorithms in Hyperbolic Geometry (MDS, K-Means, Support vector machines, etc.)☆140Updated 5 years ago
- ☆20Updated 4 years ago
- A recreation of the Lorentz embeddings paper from ICML 2018 (Nickel 2018)☆20Updated 6 years ago
- Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)☆104Updated 5 years ago
- Official implementation (learning part) for paper: Numerically Accurate Hyperbolic Embeddings Using Tiling-Based Models☆18Updated last year
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆37Updated 2 years ago
- Python implementation of smooth optimal transport.☆60Updated 4 years ago
- Embed arbitrary graphs in Hyperbolic space☆76Updated 3 years ago
- ☆12Updated 4 years ago
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 5 years ago
- Poincaré Embedding☆40Updated 7 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆44Updated 6 years ago
- SuNBEaM, (s)pectral (n)on-(b)acktracking (e)igenvalue pseudo-(m)etric, a topological graph distance☆16Updated 5 years ago
- ☆44Updated 5 years ago
- ☆17Updated 4 years ago
- Equivalence Between Structural Representations and Positional Node Embeddings☆22Updated 5 years ago
- Uncertainty in Conditional Average Treatment Effect Estimation☆33Updated 4 years ago
- Code for "Graph-based Semi-Supervised & Active Learning for Edge Flows"☆15Updated 6 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆85Updated last year
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 2 years ago
- Implicit Graph Neural Networks☆64Updated 3 years ago
- Locally corrected Nyström (LCN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, …☆19Updated 2 years ago