horacepan / MLGkernelLinks
Implementation of the Multiscale Laplacian Graph Kernel
☆19Updated 5 years ago
Alternatives and similar repositories for MLGkernel
Users that are interested in MLGkernel are comparing it to the libraries listed below
Sorting:
- mixed membership stochastic block model☆13Updated 9 years ago
- Graph kernels☆56Updated 3 years ago
- Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).☆24Updated 5 years ago
- Code for Graphite iterative graph generation☆59Updated 6 years ago
- A package for computing Graph Kernels☆104Updated 2 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆36Updated 5 years ago
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆61Updated 4 years ago
- Four of the main kernels on graphs Python implementation.☆16Updated 8 years ago
- Mixed Membership Stochastic Blockmodel Implementation with 3 Inference Schemes☆24Updated 10 years ago
- A fast MATLAB implementation of the Weisfeiler--Lehman graph transformation and associated kernel.☆11Updated 7 years ago
- OhmNet: Representation learning in multi-layer graphs☆83Updated 5 years ago
- Equivalence Between Structural Representations and Positional Node Embeddings☆22Updated 5 years ago
- Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)☆105Updated 5 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆83Updated 7 years ago
- NeurIPS 2016. Linear-time interpretable nonparametric two-sample test.☆64Updated 7 years ago
- LDP for graph classification☆23Updated 5 years ago
- Deriving Neural Architectures from Sequence and Graph Kernels☆59Updated 7 years ago
- ☆16Updated 5 years ago
- A convolutional neural network for graph classification in PyTorch☆91Updated 6 years ago
- 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
- A comprehensive collection of GNN works in NeurIPS 2019.☆21Updated 5 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆44Updated 5 years ago
- TensorFlow implementation of Deep Graph Infomax☆62Updated 6 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆27Updated 2 years ago
- D-VAE: A Variational Autoencoder for Directed Acyclic Graphs, NeurIPS 2019☆141Updated 4 years ago
- ☆76Updated 7 years ago
- PyTorch Implementation of GraphTSNE, ICLR’19☆137Updated 6 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆83Updated 11 months ago
- ☆35Updated 6 years ago
- ☆22Updated 10 years ago