Alternatives and similar repositories for gspan:

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

• ChristalC / Frequent-Subgraph-Mining
  Frequent subgraph mining using FFSM algorithm, C++
  ☆11Updated 7 years ago
• shangjingbo1226 / ContrastSubgraphMining
  Contrast Subgraph Mining from Coherent Cores
  ☆13Updated 7 years ago
• rkwitt / gboost
  A fork of Sebastian Nowozin's and Koji Tsuda's gboost code
  ☆17Updated 11 years ago
• BorgwardtLab / significant-subgraph-mining
  Finding statistically significant subgraphs while correcting for multiple testing
  ☆8Updated 9 years ago
• TonyZZX / MultiGraph_MultiLabel_Learning
  Multi-Graph Multi-Label Learning
  ☆11Updated 6 years ago
• sbarakat / graph-partitioning
  This repository contains research into the use of graph partitioning algorithms for assigning people shelters based on their social netwo…
  ☆18Updated 5 years ago
• priba / aproximated_ged
  Bunch of aproximated graph edit distance algorithms.
  ☆33Updated 6 years ago
• vermaMachineLearning / FGSD
  Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).
  ☆24Updated 4 years ago
• KarypisLab / PM4GNN
  Graph partitioning for distributed GNN training
  ☆13Updated last year
• dzambon / graph-matching-toolkit
  ☆24Updated 4 years ago
• bgauzere / graph-lib
  C++ library for graph kernel and edit distance algorithm
  ☆15Updated 6 years ago
• mims-harvard / fastGNMF
  Fast graph-regularized matrix factorization
  ☆20Updated last year
• LasseRegin / gSpan
  Implementation of the depth-first gSpan algorithm for frequent graph mining in graphs data set. Finds possible frequent and canonical ext…
  ☆18Updated 6 years ago
• dbblumenthal / gedlib
  An easily extensible C++ library for (suboptimally) computing the graph edit distance between attributed graphs.
  ☆59Updated last year
• 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
• horacepan / MLGkernel
  Implementation of the Multiscale Laplacian Graph Kernel
  ☆18Updated 5 years ago
• NaazS03 / cgSpan
  Python implementation of closed frequent subgraph mining algorithm cgSpan. Only undirected graphs are currently supported.
  ☆10Updated 3 years ago
• nphdang / gSpan
  gSpan, an efficient algorithm for mining frequent subgraphs
  ☆18Updated 5 years ago
• greyfoxamine / Overlapping-Community-Detection-Using-Seed-Set-Expansion-
  ☆8Updated 8 years ago
• vwz / SPE
  Subgraph-augmented Path Embedding for Semantic User Search on Heterogeneous Social Network
  ☆13Updated 7 years ago
• rabbanyk / CommunityEvaluation
  A framework for evaluating community mining algorithms.
  ☆11Updated 8 years ago
• dglai / minigun
  Light-weight GPU kernel interface for graph operations
  ☆15Updated 4 years ago
• cnmusco / graph-similarity-learning
  Algorithms for learning network structure from effective resistances and other random-walk-based similarities.
  ☆30Updated 7 years ago
• giannisnik / message_passing_graph_kernels
  ☆16Updated 4 years ago
• arbenson / cflp
  Code for core-fringe link prediction
  ☆11Updated 5 years ago
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 5 years ago
• RapidsAtHKUST / SimRank
  1) SimRank (single pair query, parallel all pair computation / dynamic updates) - by Yue Wang (https://github.com/KeithYue) and Yulin Che…
  ☆14Updated 4 years ago
• IBM / IPC-graph-data
  IPC: A Graph Data Set Compiled from International Planning Competitions
  ☆44Updated 5 years ago
• jinohoh / WSDM17_shot
  ☆8Updated 7 years ago
• Jokeren / gBolt
  gBolt--very fast implementation for gSpan algorithm in data mining
  ☆55Updated 3 years ago