Alternatives and similar repositories for gSpan:

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

• betterenvi / gSpan
  Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.
  ☆199Updated 4 years ago
• nphdang / GE-FSG
  Graph Embedding via Frequent Subgraphs
  ☆44Updated 4 years ago
• FFrankyy / DrBC
  DrBC: A novel graph neural network approach to identify high Betweenness Centraliy (BC) nodes ( CIKM'19 )
  ☆31Updated 4 years ago
• ZongyueQin / Graph-Hashing
  ☆16Updated 4 years ago
• ColinConduff / FrequentSubgraphMining
  This is a python implementation of the Gaston frequent subgraph mining algorithm.
  ☆19Updated 4 years ago
• LasseRegin / gSpan
  Implementation of the depth-first gSpan algorithm for frequent graph mining in graphs data set. Finds possible frequent and canonical ext…
  ☆17Updated 6 years ago
• dhivyaeswaran / sedanspot
  SedanSpot: Detecting Anomalies in Edge Streams
  ☆24Updated 6 years ago
• danielzuegner / robust-gcn
  Implementation of the paper "Certifiable Robustness and Robust Training for Graph Convolutional Networks".
  ☆42Updated 4 years ago
• flyingtango / DiGCN
  Implement of DiGCN, NeurIPS-2020
  ☆48Updated 3 years ago
• sigdata / im_benchmarking
  Code for benhcmarking 12 state-of-the-art methods in the field of Influence Maximization
  ☆19Updated 7 years ago
• ehab-abdelhamid / GraMi
  GraMi is a novel framework for frequent subgraph mining in a single large graph, GraMi outperforms existing techniques by 2 orders of ma…
  ☆111Updated last year
• linhongseba / Temporal-Network-Embedding
  The implementation that infers the temporal latent spaces for a sequence of dynamic graph snapshots
  ☆65Updated 7 years ago
• GemsLab / REGAL
  Representation learning-based graph alignment based on implicit matrix factorization and structural embeddings
  ☆94Updated 3 years ago
• ChristalC / Frequent-Subgraph-Mining
  Frequent subgraph mining using FFSM algorithm, C++
  ☆10Updated 7 years ago
• zhenv5 / atp
  ATP: Directed Graph Embedding with Asymmetric Transitivity Preservation
  ☆10Updated 5 years ago
• ehab-abdelhamid / ScaleMine
  Parallel Frequent Subgraph Mining
  ☆29Updated 7 years ago
• facebookresearch / NARS
  Scalable Graph Neural Networks for Heterogeneous Graphs
  ☆72Updated 4 years ago
• DEEP-PolyU / GraphRNA_KDD19
  Graph Recurrent Networks with Attributed Random Walks
  ☆28Updated last year
• timtadh / parsemis
  The ParSeMiS project (Parallel and Sequential Graph Mining Suite) searches for frequent, interesting substructures in graph databases. ht…
  ☆44Updated 4 years ago
• sunfanyunn / graph-classification
  A collection of graph classification methods
  ☆42Updated 4 years ago
• HKUST-KnowComp / NeuralSubgraphCounting
  Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"
  ☆53Updated 6 months ago
• yifan-h / CS-GNN
  Measuring and Improving the Use of Graph Information in Graph Neural Networks
  ☆82Updated 6 months ago
• minjiyoon / KDD19-AnomRank
  Anomaly Detection in Dynamic Graphs
  ☆32Updated last year
• RingBDStack / dynamic_network_embedding
  ☆12Updated 6 years ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆87Updated 5 years ago
• rkwitt / gboost
  A fork of Sebastian Nowozin's and Koji Tsuda's gboost code
  ☆17Updated 11 years ago
• stvdedal / gspan
  graph-based substructure pattern mining algorithm (authors: Xifeng Yan, Jiawei Han) implementation
  ☆10Updated 7 years ago
• hncuong / IM
  Code for Influence Maximization Problem
  ☆27Updated 7 years ago
• dzambon / graph-matching-toolkit
  ☆24Updated 4 years ago
• LifangHe / KDD16_HAM
  Joint Community and Structural Hole Spanner Detection via Harmonic Modularity
  ☆10Updated 6 years ago