rodrigo-pena / graph-learningLinks
☆14Updated 8 years ago
Alternatives and similar repositories for graph-learning
Users that are interested in graph-learning are comparing it to the libraries listed below
Sorting:
- ☆22Updated 4 years ago
- Topological Graph Neural Networks (ICLR 2022)☆125Updated 3 years ago
- Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'☆18Updated 2 years ago
- ☆55Updated 3 years ago
- Scattering GCN: overcoming oversmoothness in graph convolutional networks☆25Updated 3 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆86Updated last year
- Gradient gating (ICLR 2023)☆55Updated 2 years ago
- Dataset for testing graph classification algorithms, such as Graph Kernels and Graph Neural Networks.☆51Updated 10 months ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- A Note On Over-Smoothing for Graph Neural Network☆20Updated 5 years ago
- Code of "Analyzing the Expressive Power of Graph Neural Networks in a Spectral Perspective" paper published in ICLR2021☆46Updated 4 years ago
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆16Updated 5 years ago
- Graph signal processing tutorial, presented at the GraphSiP summer school.☆78Updated 6 years ago
- Python-based persistent homology algorithms☆19Updated 2 years ago
- Codes for "Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks" paper☆50Updated 4 years ago
- A Graph Structure Learning (GSL) Toolkit☆38Updated 3 years ago
- ☆62Updated 5 years ago
- Code for "Weisfeiler and Leman go sparse: Towards higher-order graph embeddings"☆21Updated 3 years ago
- GraphCON (ICML 2022)☆60Updated 3 years ago
- Code and dataset to test empirically the expressive power of graph pooling operators presented as presented at NeurIPS 2023☆36Updated 2 years ago
- ☆11Updated 2 years ago
- ☆17Updated last year
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆37Updated 5 years ago
- ☆30Updated 4 years ago
- ☆17Updated 4 years ago
- https://arxiv.org/abs/2005.06935☆12Updated 2 years ago
- WKPI: A kernel based on persistent homology☆12Updated 5 years ago
- A list for GNNs and related works.☆102Updated last month
- Code for the paper "Topological Autoencoders" by Michael Moor, Max Horn, Bastian Rieck, and Karsten Borgwardt.☆153Updated 4 years ago
- GLAD: Learning Sparse Graph Recovery☆13Updated 5 months ago