Alternatives and similar repositories for MLGkernel

Users that are interested in MLGkernel 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 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 / graph-kernels
  Graph kernels
  ☆56Updated 3 years ago
• BorgwardtLab / P-WL
  A Persistent Weisfeiler–Lehman Procedure for Graph Classification
  ☆61Updated 4 years ago
• cnmusco / graph-similarity-learning
  Algorithms for learning network structure from effective resistances and other random-walk-based similarities.
  ☆31Updated 7 years ago
• nkeriven / random-graph-gnn
  ☆12Updated 4 years ago
• matthieuheitz / WassersteinDictionaryLearning
  Morgan A. Schmitz., Matthieu Heitz, Nicolas Bonneel, Fred Ngole, David Coeurjolly, Marco Cuturi, Gabriel Peyré, and Jean-Luc Starck. "Was…
  ☆20Updated 5 years ago
• ermongroup / graphite
  Code for Graphite iterative graph generation
  ☆59Updated 6 years ago
• giannisnik / cnn-graph-classification
  A convolutional neural network for graph classification in PyTorch
  ☆91Updated 6 years ago
• Caselles / graph_kernels
  Four of the main kernels on graphs Python implementation.
  ☆16Updated 8 years ago
• danielegrattarola / cdt-ccm-aae
  Change Detection in Graph Streams by Learning Graph Embeddings on Constant-Curvature Manifolds (2018, https://arxiv.org/abs/1805.06299)
  ☆11Updated 5 years ago
• PurdueMINDS / RelationalPooling
  ☆35Updated 6 years ago
• taolei87 / icml17_knn
  Deriving Neural Architectures from Sequence and Graph Kernels
  ☆59Updated 7 years ago
• rmgarnett / fast_wl
  A fast MATLAB implementation of the Weisfeiler--Lehman graph transformation and associated kernel.
  ☆11Updated 7 years ago
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆26Updated 2 years ago
• xbresson / IPAM_Tutorial_2019
  Notebooks for IPAM Tutorial, March 15 2019
  ☆24Updated 6 years ago
• hichamjanati / mtw
  Wasserstein regularization for sparse multi-task regression
  ☆15Updated 4 years ago
• giannisnik / message_passing_graph_kernels
  ☆16Updated 5 years ago
• mims-harvard / ohmnet
  OhmNet: Representation learning in multi-layer graphs
  ☆83Updated 4 years ago
• zhegan27 / dpfa_icml2015
  The Matlab Code for the ICML 2015 paper "Scalable Deep Poisson Factor Analysis for Topic Modeling"
  ☆19Updated 9 years ago
• IBM / IPC-graph-data
  IPC: A Graph Data Set Compiled from International Planning Competitions
  ☆46Updated 5 years ago
• PurdueMINDS / Equivalence
  Equivalence Between Structural Representations and Positional Node Embeddings
  ☆22Updated 5 years ago
• mims-harvard / fastGNMF
  Fast graph-regularized matrix factorization
  ☆20Updated last year
• nd7141 / AWE
  Compute graph embeddings via Anonymous Walk Embeddings
  ☆83Updated 6 years ago
• bluer555 / KernelGCN
  Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs
  ☆34Updated 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
• gn-exp / gn-exp
  Anonymous Repository for ICML LRG Workshop: On Explainability Techniques for Graph Convolutional Networks
  ☆23Updated 6 years ago
• wooden-spoon / relational-ERM
  Software relating to relational empirical risk minimization
  ☆17Updated 4 years ago
• wojzaremba / btest
  ☆16Updated 11 years ago