rmgarnett / fast_wlLinks
A fast MATLAB implementation of the Weisfeiler--Lehman graph transformation and associated kernel.
☆11Updated 7 years ago
Alternatives and similar repositories for fast_wl
Users that are interested in fast_wl are comparing it to the libraries listed below
Sorting:
- Implementation of the Multiscale Laplacian Graph Kernel☆19Updated 5 years ago
- A package for computing Graph Kernels☆104Updated 2 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆83Updated 11 months ago
- A Python implementation of a fast approximation of the Weisfeiler-Lehman Graph Kernels.☆24Updated 6 years ago
- Graph kernels☆56Updated 3 years ago
- Four of the main kernels on graphs Python implementation.☆16Updated 8 years ago
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆61Updated 4 years ago
- mixed membership stochastic block model☆13Updated 9 years ago
- Conformal prediction is a framework for providing accuracy guarantees on the predictions of a base predictor☆9Updated 6 years ago
- A python package for graph kernels, graph edit distances, and graph pre-image problem.☆128Updated 2 months ago
- WKPI: A kernel based on persistent homology☆12Updated 5 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Graph Learning from Data☆35Updated 5 years ago
- Experimental Matlab code for methods and some examples in "Higher-order organization of complex networks"☆41Updated 6 years ago
- NetLSD descriptors for graphs. Compare and analyze graph structure on multiple levels!☆60Updated 5 years ago
- ☆19Updated 2 years ago
- ☆16Updated 5 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆88Updated 6 years ago
- ☆143Updated 4 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆83Updated 7 years ago
- Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).☆24Updated 5 years ago
- LDP for graph classification☆23Updated 5 years ago
- "Explainable classification of brain networks via contrast subgraphs" - T. Lanciano, F. Bonchi, A. Gionis☆20Updated 3 years ago
- Code for paper: Overlapping Community Detection via Nonnegative Matrix Factorization☆10Updated 11 years ago
- Code for "M. Zhang, Z. Cui, M. Neumann, and Y. Chen, An End-to-End Deep Learning Architecture for Graph Classification, AAAI-18".☆177Updated 7 years ago
- Code and data for the paper `Bayesian Semi-supervised Learning with Graph Gaussian Processes'☆38Updated 6 years ago
- ☆173Updated 6 years ago
- Local community detection code that implements the methods used in Think Locally, Act Locally: The Detection of Small, Medium-Sized, and …☆13Updated 7 years ago
- Gaussian node embeddings. Implementation of "Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking".☆175Updated 2 years ago
- Python package for graph-based clustering and semi-supervised learning☆94Updated 4 months ago