Alternatives and similar repositories for fast_wl

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

• horacepan / MLGkernel
  Implementation of the Multiscale Laplacian Graph Kernel
  ☆19Updated 5 years ago
• BorgwardtLab / graph-kernels
  Graph kernels
  ☆56Updated 3 years ago
• BorgwardtLab / GraphKernels
  A package for computing Graph Kernels
  ☆104Updated last year
• BorgwardtLab / P-WL
  A Persistent Weisfeiler–Lehman Procedure for Graph Classification
  ☆61Updated 4 years ago
• lorenzopalloni / wl-graph-kernels
  A Python implementation of a fast approximation of the Weisfeiler-Lehman Graph Kernels.
  ☆24Updated 6 years ago
• dongwookim-ml / MMSB
  mixed membership stochastic block model
  ☆13Updated 9 years ago
• Caselles / graph_kernels
  Four of the main kernels on graphs Python implementation.
  ☆16Updated 8 years ago
• vermaMachineLearning / FGSD
  Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).
  ☆24Updated 5 years ago
• cnmusco / graph-similarity-learning
  Algorithms for learning network structure from effective resistances and other random-walk-based similarities.
  ☆31Updated 7 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 7 years ago
• BorgwardtLab / WWL
  Wasserstein Weisfeiler-Lehman Graph Kernels
  ☆83Updated 10 months ago
• annamalai-nr / subgraph2vec_tf
  This repository contains the TensorFlow implemtation of subgraph2vec (KDD MLG 2016) paper
  ☆26Updated 7 years ago
• mims-harvard / ohmnet
  OhmNet: Representation learning in multi-layer graphs
  ☆83Updated 4 years ago
• arbenson / higher-order-organization-matlab
  Experimental Matlab code for methods and some examples in "Higher-order organization of complex networks"
  ☆41Updated 6 years ago
• leotrs / sunbeam
  SuNBEaM, (s)pectral (n)on-(b)acktracking (e)igenvalue pseudo-(m)etric, a topological graph distance
  ☆15Updated 5 years ago
• nd7141 / AWE
  Compute graph embeddings via Anonymous Walk Embeddings
  ☆83Updated 7 years ago
• guillaumejaume / edGNN
  Code for the paper: "edGNN: A simple and powerful GNN for labeled graphs"
  ☆43Updated 2 years ago
• muhanzhang / LinkPrediction
  Code for "M. Zhang, Y. Chen, Weisfeiler-Lehman Neural Machine for Link Prediction, KDD 2017 oral"
  ☆56Updated 6 years ago
• jajupmochi / graphkit-learn
  A python package for graph kernels, graph edit distances, and graph pre-image problem.
  ☆128Updated last month
• dzambon / graph-matching-toolkit
  ☆25Updated 4 years ago
• giannisnik / message_passing_graph_kernels
  ☆16Updated 5 years ago
• zhengwang100 / RSDNE
  RSDNE: Exploring Relaxed Similarity and Dissimilarity from Completely-imbalanced Labels for Network Embedding. AAAI18
  ☆13Updated 5 years ago
• davidhallac / NetworkLasso
  ☆22Updated 10 years ago
• 000Justin000 / ssl_edge
  Code for "Graph-based Semi-Supervised & Active Learning for Edge Flows"
  ☆15Updated 6 years ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆87Updated 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
• kd383 / NetworkDOS
  Network Density of States (https://arxiv.org/abs/1905.09758) (KDD 2019)
  ☆25Updated 5 years ago
• topology474 / WKPI
  WKPI: A kernel based on persistent homology
  ☆12Updated 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…
  ☆11Updated 5 years ago
• TRI-GNN / TRI-GNN
  ☆12Updated 3 years ago