rmgarnett / fast_wl
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
- Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).☆24Updated 4 years ago
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆60Updated 3 years ago
- Implementation of the Multiscale Laplacian Graph Kernel☆18Updated 5 years ago
- A Python implementation of a fast approximation of the Weisfeiler-Lehman Graph Kernels.☆23Updated 5 years ago
- Graph kernels☆56Updated 3 years ago
- Four of the main kernels on graphs Python implementation.☆16Updated 8 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆81Updated 5 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
- LDP for graph classification☆23Updated 5 years ago
- WKPI: A kernel based on persistent homology☆12Updated 4 years ago
- mixed membership stochastic block model☆13Updated 8 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆82Updated 6 years ago
- Code for "Weisfeiler and Leman go sparse: Towards higher-order graph embeddings"☆22Updated 3 years ago
- This repository contains the TensorFlow implemtation of subgraph2vec (KDD MLG 2016) paper☆26Updated 7 years ago
- A package for computing Graph Kernels☆103Updated last year
- Gaussian node embeddings. Implementation of "Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking".☆174Updated last year
- ☆16Updated 4 years ago
- ☆12Updated 6 years ago
- Equivalence Between Structural Representations and Positional Node Embeddings☆21Updated 5 years ago
- NetLSD descriptors for graphs. Compare and analyze graph structure on multiple levels!☆59Updated 4 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆42Updated 5 years ago
- The implementation of our AAAI 2020 paper "GSSNN: Graph Smoothing Splines Neural Network".☆20Updated 4 years ago
- Code for "M. Zhang, Y. Chen, Weisfeiler-Lehman Neural Machine for Link Prediction, KDD 2017 oral"☆55Updated 6 years ago
- This is the official implementation of "Arbitrary-Order Proximity Preserved Network Embedding"(KDD 2018).☆38Updated 5 years ago
- Code for the paper: "edGNN: A simple and powerful GNN for labeled graphs"☆42Updated last year
- Continuous-Time Relationship Prediction in Dynamic Heterogeneous Information Networks (TKDD 2019)☆18Updated 2 years ago
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆16Updated 4 years ago
- embedding attributed graphs☆58Updated 3 years ago
- Graph Embedding via Frequent Subgraphs☆44Updated 4 years ago
- Implementation of the paper "Certifiable Robustness and Robust Training for Graph Convolutional Networks".☆42Updated 4 years ago