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
• BorgwardtLab / significant-subgraph-mining
  Finding statistically significant subgraphs while correcting for multiple testing
  ☆8Updated 9 years ago
• rkwitt / gboost
  A fork of Sebastian Nowozin's and Koji Tsuda's gboost code
  ☆17Updated 12 years ago
• vermaMachineLearning / FGSD
  Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).
  ☆24Updated 5 years ago
• bgauzere / graph-lib
  C++ library for graph kernel and edit distance algorithm
  ☆15Updated 6 years ago
• cuMF / culda_cgs
  Efficient LDA solution on GPUs.
  ☆24Updated 6 years ago
• TonyZZX / MultiGraph_MultiLabel_Learning
  Multi-Graph Multi-Label Learning
  ☆11Updated 7 years ago
• priba / aproximated_ged
  Bunch of aproximated graph edit distance algorithms.
  ☆36Updated 6 years ago
• horacepan / MLGkernel
  Implementation of the Multiscale Laplacian Graph Kernel
  ☆19Updated 5 years ago
• KarypisLab / K-Truss
  OpenMP-based parallel software for computing the truss decomposition of a graph.
  ☆14Updated 7 years ago
• cnmusco / graph-similarity-learning
  Algorithms for learning network structure from effective resistances and other random-walk-based similarities.
  ☆31Updated 7 years ago
• mims-harvard / fastGNMF
  Fast graph-regularized matrix factorization
  ☆20Updated last year
• KarypisLab / PM4GNN
  Graph partitioning for distributed GNN training
  ☆14Updated 2 years ago
• AnirudhDagar / MessagePassing_for_GNNs
  Experiments with Message Passing GNNs in C++ and PyTorch.
  ☆26Updated 11 months ago
• ryanrossi / dynamic-pagerank
  Dynamic PageRank
  ☆16Updated 9 years ago
• jinohoh / WSDM17_shot
  ☆8Updated 8 years ago
• rabbanyk / CommunityEvaluation
  A framework for evaluating community mining algorithms.
  ☆11Updated 9 years ago
• ehab-abdelhamid / ScaleMine
  Parallel Frequent Subgraph Mining
  ☆31Updated 7 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
• 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
• spcl / gms
  GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning
  ☆26Updated 4 years ago
• dzambon / graph-matching-toolkit
  ☆25Updated 4 years ago
• giannisnik / message_passing_graph_kernels
  ☆16Updated 5 years ago
• dglai / minigun
  Light-weight GPU kernel interface for graph operations
  ☆15Updated 5 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 6 years ago
• alexbeutel / FlexiFaCT
  Run large scale tensor and coupled matrix-tensor factorization on top of stock Hadoop.
  ☆18Updated 7 years ago
• nphdang / gSpan
  gSpan, an efficient algorithm for mining frequent subgraphs
  ☆19Updated 5 years ago
• vwz / SPE
  Subgraph-augmented Path Embedding for Semantic User Search on Heterogeneous Social Network
  ☆13Updated 7 years ago
• domargan / parallel-packed-csr
  A parallel packed CSR data structure for large-scale dynamic graphs
  ☆14Updated 2 years ago