Alternatives and similar repositories for FGSD

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

• horacepan / MLGkernel
  Implementation of the Multiscale Laplacian Graph Kernel
  ☆19Updated 5 years ago
• PurdueMINDS / Equivalence
  Equivalence Between Structural Representations and Positional Node Embeddings
  ☆22Updated 5 years ago
• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆36Updated 5 years ago
• dongwookim-ml / MMSB
  mixed membership stochastic block model
  ☆13Updated 9 years ago
• BorgwardtLab / P-WL
  A Persistent Weisfeiler–Lehman Procedure for Graph Classification
  ☆61Updated 4 years ago
• nkeriven / random-graph-gnn
  ☆12Updated 4 years ago
• ermongroup / graphite
  Code for Graphite iterative graph generation
  ☆59Updated 6 years ago
• PurdueMINDS / RelationalPooling
  ☆35Updated 6 years ago
• taolei87 / icml17_knn
  Deriving Neural Architectures from Sequence and Graph Kernels
  ☆59Updated 7 years ago
• BorgwardtLab / graph-kernels
  Graph kernels
  ☆56Updated 3 years ago
• dfdazac / dgi
  TensorFlow implementation of Deep Graph Infomax
  ☆62Updated 6 years ago
• melifluos / Hyperbolic-Embedding
  Learning neural network embeddings in hyperbolic spaces
  ☆14Updated 5 years ago
• bluer555 / KernelGCN
  Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs
  ☆34Updated 5 years ago
• yincheng / GGP
  Code and data for the paper `Bayesian Semi-supervised Learning with Graph Gaussian Processes'
  ☆38Updated 6 years ago
• mims-harvard / fastGNMF
  Fast graph-regularized matrix factorization
  ☆20Updated last year
• ZW-ZHANG / TIMERS
  This is a sample implementation of "TIMERS: Error-Bounded SVD Restart on Dynamic Networks"(AAAI 2018).
  ☆12Updated 6 years ago
• nd7141 / AWE
  Compute graph embeddings via Anonymous Walk Embeddings
  ☆83Updated 6 years ago
• joanbruna / GNN_community
  Implementation of the paper "Community Detection with Graph Neural Networks", by J. Bruna and L. Li
  ☆74Updated 8 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)
  ☆16Updated 5 years ago
• delta2323 / gnn-asymptotics
  Code for Graph Neural Networks Exponentially Lose Expressive Power for Node Classification.
  ☆30Updated 5 years ago
• benedekrozemberczki / FEATHER
  The reference implementation of FEATHER from the CIKM '20 paper "Characteristic Functions on Graphs: Birds of a Feather, from Statistical…
  ☆51Updated 2 years ago
• matenure / OTCoarsening
  Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport
  ☆37Updated 4 years ago
• chentingpc / gfn
  Code for "Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification"
  ☆52Updated 5 years ago
• xgfs / NetLSD
  NetLSD descriptors for graphs. Compare and analyze graph structure on multiple levels!
  ☆59Updated 5 years ago
• Caselles / graph_kernels
  Four of the main kernels on graphs Python implementation.
  ☆16Updated 8 years ago
• KangchengHou / gntk
  Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)
  ☆104Updated 5 years ago
• cvignac / SMP
  ☆28Updated 3 years ago
• guillaumejaume / edGNN
  Code for the paper: "edGNN: A simple and powerful GNN for labeled graphs"
  ☆43Updated 2 years ago
• pankajk / Deep-Graph-Kernels
  Deep Graph Kernels
  ☆13Updated 9 years ago
• IBM / IPC-graph-data
  IPC: A Graph Data Set Compiled from International Planning Competitions
  ☆46Updated 5 years ago