rmgarnett / fast_wl

Related projects ⓘ

Alternatives and complementary repositories for fast_wl

• vermaMachineLearning / FGSD
  Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).
  ☆24Updated 4 years ago
• Caselles / graph_kernels
  Four of the main kernels on graphs Python implementation.
  ☆16Updated 7 years ago
• annamalai-nr / subgraph2vec_tf
  This repository contains the TensorFlow implemtation of subgraph2vec (KDD MLG 2016) paper
  ☆26Updated 7 years ago
• BorgwardtLab / graph-kernels
  Graph kernels
  ☆55Updated 2 years ago
• lorenzopalloni / wl-graph-kernels
  A Python implementation of a fast approximation of the Weisfeiler-Lehman Graph Kernels.
  ☆22Updated 5 years ago
• horacepan / MLGkernel
  Implementation of the Multiscale Laplacian Graph Kernel
  ☆18Updated 5 years ago
• BorgwardtLab / WWL
  Wasserstein Weisfeiler-Lehman Graph Kernels
  ☆78Updated 2 months ago
• Chen-Cai-OSU / LDP
  LDP for graph classification
  ☆23Updated 5 years ago
• BorgwardtLab / P-WL
  A Persistent Weisfeiler–Lehman Procedure for Graph Classification
  ☆60Updated 3 years ago
• TheGravLab / A-Unifying-Framework-for-Spectrum-Preserving-Graph-Sparsification-and-Coarsening
  Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)
  ☆15Updated 4 years ago
• xgfs / NetLSD
  NetLSD descriptors for graphs. Compare and analyze graph structure on multiple levels!
  ☆60Updated 4 years ago
• kd383 / NetworkDOS
  Network Density of States (https://arxiv.org/abs/1905.09758) (KDD 2019)
  ☆25Updated 5 years ago
• BorgwardtLab / GraphKernels
  A package for computing Graph Kernels
  ☆102Updated last year
• edouardpineau / A-simple-baseline-algorithm-for-graph-classification
  Github page for the paper "A simple baseline algorithm for graph classification" presented at the R2L workshop of NIPS 2018
  ☆25Updated 4 years ago
• HongtengXu / s-gwl
  Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
  ☆40Updated 5 years ago
• 000Justin000 / ssl_edge
  Code for "Graph-based Semi-Supervised & Active Learning for Edge Flows"
  ☆15Updated 5 years ago
• NaazS03 / cgSpan
  Python implementation of closed frequent subgraph mining algorithm cgSpan. Only undirected graphs are currently supported.
  ☆9Updated 2 years ago
• nd7141 / AWE
  Compute graph embeddings via Anonymous Walk Embeddings
  ☆81Updated 6 years ago
• chrsmrrs / glocalwl
  Source code for our IEEE ICDM 2017 paper "Glocalized Weisfeiler-Lehman Graph Kernels: Global-Local Feature Maps of Graphs".
  ☆11Updated 7 years ago
• dongwookim-ml / MMSB
  mixed membership stochastic block model
  ☆13Updated 8 years ago
• LJeub / LocalCommunities
  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
• ZW-ZHANG / AROPE
  This is the official implementation of "Arbitrary-Order Proximity Preserved Network Embedding"(KDD 2018).
  ☆38Updated 5 years ago
• dzambon / graph-matching-toolkit
  ☆23Updated 4 years ago
• paulmorio / geo2dr
  Geo2DR: A Python and PyTorch library for learning distributed representations of graphs.
  ☆45Updated last year
• cvignac / SMP
  ☆26Updated 3 years ago
• vunhatminh / PGMExplainer
  Generating PGM Explanation for GNN predictions
  ☆73Updated last year
• chrsmrrs / sparsewl
  Code for "Weisfeiler and Leman go sparse: Towards higher-order graph embeddings"
  ☆22Updated 2 years ago
• shionhonda / gae-dgl
  Reimplementation of Graph Autoencoder by Kipf & Welling with DGL.
  ☆65Updated last year
• yincheng / GGP
  Code and data for the paper `Bayesian Semi-supervised Learning with Graph Gaussian Processes'
  ☆38Updated 6 years ago
• jajupmochi / graphkit-learn
  A python package for graph kernels, graph edit distances, and graph pre-image problem.
  ☆123Updated 8 months ago