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 Python implementation of a fast approximation of the Weisfeiler-Lehman Graph Kernels.☆24Updated 5 years ago
- Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).☆24Updated 5 years ago
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆61Updated 3 years ago
- Four of the main kernels on graphs Python implementation.☆16Updated 8 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆81Updated 9 months ago
- Source code for our IEEE ICDM 2017 paper "Glocalized Weisfeiler-Lehman Graph Kernels: Global-Local Feature Maps of Graphs".☆11Updated 7 years ago
- A package for computing Graph Kernels☆104Updated last year
- Implementation of SBM-meet-GNN☆23Updated 6 years ago
- mixed membership stochastic block model☆13Updated 8 years ago
- Graph kernels☆56Updated 3 years ago
- Network Density of States (https://arxiv.org/abs/1905.09758) (KDD 2019)☆25Updated 5 years ago
- Tools for the generation, analysis and visualisation of complex networks in hyperbolic space.☆27Updated 6 years ago
- LDP for graph classification☆23Updated 5 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆43Updated 5 years ago
- RSDNE: Exploring Relaxed Similarity and Dissimilarity from Completely-imbalanced Labels for Network Embedding. AAAI18☆12Updated 5 years ago
- Local community detection code that implements the methods used in Think Locally, Act Locally: The Detection of Small, Medium-Sized, and …☆13Updated 6 years ago
- ☆12Updated 7 years ago
- Gaussian node embeddings. Implementation of "Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking".☆174Updated 2 years ago
- LEAP (Learning Edges by Aggregation of Paths)☆12Updated last year
- Matlab code for tree-Wasserstein distance in the paper "Tree-Sliced Variants of Wasserstein Distances", NeurIPS, 2019. (Tam Le, Makoto Y…☆11Updated 5 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆83Updated 6 years ago
- Code and data for the paper `Bayesian Semi-supervised Learning with Graph Gaussian Processes'☆38Updated 6 years ago
- DenseAlert: Incremental Dense-SubTensor Detection in Tensor Streams (KDD'17)☆19Updated 7 months ago
- This repository contains the TensorFlow implemtation of subgraph2vec (KDD MLG 2016) paper☆26Updated 7 years ago
- Laplacian Change Point Detection for Dynamic Graphs (KDD 2020)☆27Updated last year
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆16Updated 4 years ago
- Code for "M. Zhang, Y. Chen, Weisfeiler-Lehman Neural Machine for Link Prediction, KDD 2017 oral"☆56Updated 6 years ago
- Implementation of the paper "Certifiable Robustness and Robust Training for Graph Convolutional Networks".☆43Updated 4 years ago
- Advancing GraphSAGE with A Data-driven Node Sampling☆26Updated 2 years ago