Alternatives and similar repositories for MLGkernel

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

• dongwookim-ml / MMSB
  mixed membership stochastic block model
  ☆13Updated 9 years ago
• BorgwardtLab / graph-kernels
  Graph kernels
  ☆56Updated 3 years ago
• vermaMachineLearning / FGSD
  Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).
  ☆24Updated 5 years ago
• aburnap / Mixed-Membership-Stochastic-Blockmodel
  Mixed Membership Stochastic Blockmodel Implementation with 3 Inference Schemes
  ☆24Updated 10 years ago
• ermongroup / graphite
  Code for Graphite iterative graph generation
  ☆59Updated 6 years ago
• BorgwardtLab / P-WL
  A Persistent Weisfeiler–Lehman Procedure for Graph Classification
  ☆63Updated 4 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)
  ☆105Updated 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
• BorgwardtLab / GraphKernels
  A package for computing Graph Kernels
  ☆104Updated 2 years ago
• Chen-Cai-OSU / LDP
  LDP for graph classification
  ☆23Updated 5 years ago
• mims-harvard / ohmnet
  OhmNet: Representation learning in multi-layer graphs
  ☆83Updated 5 years ago
• rmgarnett / fast_wl
  A fast MATLAB implementation of the Weisfeiler--Lehman graph transformation and associated kernel.
  ☆11Updated 7 years ago
• muhanzhang / D-VAE
  D-VAE: A Variational Autoencoder for Directed Acyclic Graphs, NeurIPS 2019
  ☆141Updated 4 years ago
• google / gumbel_sinkhorn
  ☆76Updated 8 years ago
• cnmusco / graph-similarity-learning
  Algorithms for learning network structure from effective resistances and other random-walk-based similarities.
  ☆31Updated 7 years ago
• trneedham / gromov-wasserstein-statistics
  Statistics on the space of asymmetric networks via Gromov-Wasserstein distance
  ☆13Updated 5 years ago
• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆36Updated 5 years ago
• PurdueMINDS / RelationalPooling
  ☆35Updated 6 years ago
• nd7141 / AWE
  Compute graph embeddings via Anonymous Walk Embeddings
  ☆83Updated 7 years ago
• tvayer / FGW
  Code for Optimal Transport for structured data with application on graphs
  ☆102Updated 2 years ago
• giannisnik / cnn-graph-classification
  A convolutional neural network for graph classification in PyTorch
  ☆91Updated 6 years ago
• taolei87 / icml17_knn
  Deriving Neural Architectures from Sequence and Graph Kernels
  ☆59Updated 7 years ago
• HongtengXu / s-gwl
  Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
  ☆44Updated 6 years ago
• zhegan27 / dpfa_icml2015
  The Matlab Code for the ICML 2015 paper "Scalable Deep Poisson Factor Analysis for Topic Modeling"
  ☆19Updated 10 years ago
• Hanjun-Dai / steady_state_embedding
  Learning Steady-States of Iterative Algorithms over Graphs
  ☆40Updated 7 years ago
• PurdueMINDS / Equivalence
  Equivalence Between Structural Representations and Positional Node Embeddings
  ☆22Updated 5 years ago
• 000Justin000 / ssl_edge
  Code for "Graph-based Semi-Supervised & Active Learning for Edge Flows"
  ☆15Updated 6 years ago
• kd383 / NetworkDOS
  Network Density of States (https://arxiv.org/abs/1905.09758) (KDD 2019)
  ☆25Updated 6 years ago
• HongtengXu / gwl
  Gromov-Wasserstein Learning for Graph Matching and Node Embedding
  ☆72Updated 6 years ago