Alternatives and similar repositories for fast_wl:

Users that are interested in fast_wl are comparing it to the libraries listed below

• vermaMachineLearning / FGSD
  Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).
  ☆24Updated 4 years ago
• horacepan / MLGkernel
  Implementation of the Multiscale Laplacian Graph Kernel
  ☆18Updated 5 years ago
• Caselles / graph_kernels
  Four of the main kernels on graphs Python implementation.
  ☆16Updated 7 years ago
• BorgwardtLab / graph-kernels
  Graph kernels
  ☆56Updated 3 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
• danielzuegner / robust-gcn
  Implementation of the paper "Certifiable Robustness and Robust Training for Graph Convolutional Networks".
  ☆42Updated 4 years ago
• BorgwardtLab / WWL
  Wasserstein Weisfeiler-Lehman Graph Kernels
  ☆81Updated 4 months ago
• lorenzopalloni / wl-graph-kernels
  A Python implementation of a fast approximation of the Weisfeiler-Lehman Graph Kernels.
  ☆23Updated 5 years ago
• BorgwardtLab / P-WL
  A Persistent Weisfeiler–Lehman Procedure for Graph Classification
  ☆60Updated 3 years ago
• chentingpc / gfn
  Code for "Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification"
  ☆51Updated 4 years ago
• Chen-Cai-OSU / LDP
  LDP for graph classification
  ☆23Updated 5 years ago
• giannisnik / message_passing_graph_kernels
  ☆16Updated 4 years ago
• BorgwardtLab / filtration_curves
  Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'
  ☆18Updated last year
• nikhil-dce / SBM-meet-GNN
  Implementation of SBM-meet-GNN
  ☆22Updated 5 years ago
• lttam / TreeWasserstein
  Matlab code for tree-Wasserstein distance in the paper "Tree-Sliced Variants of Wasserstein Distances", NeurIPS, 2019. (Tam Le, Makoto Y…
  ☆12Updated 4 years ago
• dongwookim-ml / MMSB
  mixed membership stochastic block model
  ☆13Updated 8 years ago
• kd383 / NetworkDOS
  Network Density of States (https://arxiv.org/abs/1905.09758) (KDD 2019)
  ☆25Updated 5 years ago
• annamalai-nr / subgraph2vec_tf
  This repository contains the TensorFlow implemtation of subgraph2vec (KDD MLG 2016) paper
  ☆26Updated 7 years ago
• HongtengXu / s-gwl
  Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
  ☆42Updated 5 years ago
• TRI-GNN / TRI-GNN
  ☆11Updated 2 years ago
• nd7141 / AWE
  Compute graph embeddings via Anonymous Walk Embeddings
  ☆81Updated 6 years ago
• BorgwardtLab / GraphKernels
  A package for computing Graph Kernels
  ☆103Updated last year
• ZW-ZHANG / AROPE
  This is the official implementation of "Arbitrary-Order Proximity Preserved Network Embedding"(KDD 2018).
  ☆38Updated 5 years ago
• jinohoh / WSDM17_shot
  ☆9Updated 7 years ago
• snash4 / GAT2VEC
  embedding attributed graphs
  ☆58Updated 3 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆31Updated 3 years ago
• benedekrozemberczki / FEATHER
  The reference implementation of FEATHER from the CIKM '20 paper "Characteristic Functions on Graphs: Birds of a Feather, from Statistical…
  ☆49Updated last year
• zhengwang100 / RSDNE
  RSDNE: Exploring Relaxed Similarity and Dissimilarity from Completely-imbalanced Labels for Network Embedding. AAAI18
  ☆12Updated 4 years ago
• cnmusco / graph-similarity-learning
  Algorithms for learning network structure from effective resistances and other random-walk-based similarities.
  ☆31Updated 6 years ago