rmgarnett / fast_wlLinks
A fast MATLAB implementation of the Weisfeiler--Lehman graph transformation and associated kernel.
☆11Updated 8 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
- Four of the main kernels on graphs Python implementation.☆16Updated 8 years ago
- Graph kernels☆55Updated 3 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆85Updated last year
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆63Updated 4 years ago
- A Python implementation of a fast approximation of the Weisfeiler-Lehman Graph Kernels.☆24Updated 6 years ago
- Gaussian node embeddings. Implementation of "Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking".☆177Updated 2 years ago
- WKPI: A kernel based on persistent homology☆12Updated 5 years ago
- mixed membership stochastic block model☆13Updated 9 years ago
- A python package for graph kernels, graph edit distances, and graph pre-image problem.☆128Updated 4 months ago
- ☆16Updated 5 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".☆178Updated 7 years ago
- OhmNet: Representation learning in multi-layer graphs☆83Updated 5 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆83Updated 7 years ago
- This repository contains the "tensorflow" implementation of our paper "graph2vec: Learning distributed representations of graphs".☆157Updated 7 years ago
- Github page for the paper "A simple baseline algorithm for graph classification" presented at the R2L workshop of NIPS 2018☆28Updated 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 7 years ago
- Graphs clustering using kernel measures and estimators. Kernel KMeans, Spectral Clustering, Kernel Ward etc.☆18Updated last year
- This is the official implementation of "Arbitrary-Order Proximity Preserved Network Embedding"(KDD 2018).☆38Updated 6 years ago
- NetLSD descriptors for graphs. Compare and analyze graph structure on multiple levels!☆61Updated 5 years ago
- PyTorch Implementation of GraphTSNE, ICLR’19☆137Updated 6 years ago
- Code and data for the paper `Bayesian Semi-supervised Learning with Graph Gaussian Processes'☆38Updated 7 years ago
- This is a TensorFlow implementation of the Adversarially Regularized Graph Autoencoder(ARGA) model as described in our paper: Pan, S., …☆187Updated 3 years ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆55Updated 8 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆89Updated 6 years ago
- A package for computing Graph Kernels☆33Updated 7 years ago
- Code for "M. Zhang, Y. Chen, Weisfeiler-Lehman Neural Machine for Link Prediction, KDD 2017 oral"☆57Updated 7 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Source code from the NeurIPS 2019 workshop article "Keep It Simple: Graph Autoencoders Without Graph Convolutional Networks" (G. Salha, R…☆134Updated 5 years ago