Alternatives and similar repositories for gSpan:

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

• 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…
  ☆112Updated last year
• betterenvi / gSpan
  Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.
  ☆201Updated 4 years ago
• facebookresearch / NARS
  Scalable Graph Neural Networks for Heterogeneous Graphs
  ☆71Updated 4 years ago
• rkwitt / gboost
  A fork of Sebastian Nowozin's and Koji Tsuda's gboost code
  ☆17Updated 12 years ago
• ehab-abdelhamid / ScaleMine
  Parallel Frequent Subgraph Mining
  ☆31Updated 7 years ago
• ColinConduff / FrequentSubgraphMining
  This is a python implementation of the Gaston frequent subgraph mining algorithm.
  ☆20Updated 5 years ago
• houchengbin / OpenANE
  OpenANE: the first Open source framework specialized in Attributed Network Embedding. The related paper was accepted by Neurocomputing. h…
  ☆42Updated 3 years ago
• HKUST-KnowComp / NeuralSubgraphCounting
  Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"
  ☆53Updated 9 months ago
• timtadh / parsemis
  The ParSeMiS project (Parallel and Sequential Graph Mining Suite) searches for frequent, interesting substructures in graph databases. ht…
  ☆44Updated 5 years ago
• eXascaleInfolab / ActiveLink
  Deep active learning framework for link prediction in knowledge graph
  ☆25Updated 4 years ago
• DEEP-PolyU / GraphRNA_KDD19
  Graph Recurrent Networks with Attributed Random Walks
  ☆28Updated last year
• GemsLab / REGAL
  Representation learning-based graph alignment based on implicit matrix factorization and structural embeddings
  ☆95Updated 4 years ago
• nphdang / GE-FSG
  Graph Embedding via Frequent Subgraphs
  ☆45Updated 5 years ago
• FFrankyy / DrBC
  DrBC: A novel graph neural network approach to identify high Betweenness Centraliy (BC) nodes ( CIKM'19 )
  ☆32Updated 4 years ago
• RingBDStack / dynamic_network_embedding
  ☆12Updated 6 years ago
• ZongyueQin / Graph-Hashing
  ☆16Updated 4 years ago
• GemsLab / KGist
  Knowledge Graph summarization for anomaly/error detection & completion (WebConf '20)
  ☆38Updated 4 years ago
• snash4 / GAT2VEC
  embedding attributed graphs
  ☆57Updated 3 years ago
• ChristalC / Frequent-Subgraph-Mining
  Frequent subgraph mining using FFSM algorithm, C++
  ☆11Updated 7 years ago
• maxuewei2 / RiWalk
  Code for the ICDM 2019 Paper "RiWalk: Fast Structural Node Embedding via Role Identification".
  ☆14Updated 5 years ago
• wangsibovictor / fora
  FORA: Simple and Effective Approximate Single-Source Personalized Pagerank
  ☆31Updated 4 years ago
• xptree / LightNE
  ☆24Updated 3 years ago
• shuaiOKshuai / D2AGE
  The source codes for D2AGE model. Distance-aware DAG Embedding for Proximity Search on Heterogeneous Graphs.
  ☆12Updated 7 years ago
• zexihuang / random-walk-embedding
  A Broader Picture of Random-walk Based Graph Embedding
  ☆30Updated 3 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…
  ☆18Updated 7 years ago
• fukien / BiANE
  Codes for our SIGIR'20 paper "BiANE: Bipartite Attributed Network Embedding".
  ☆14Updated 10 months ago
• ZW-ZHANG / AROPE
  This is the official implementation of "Arbitrary-Order Proximity Preserved Network Embedding"(KDD 2018).
  ☆38Updated 6 years ago
• Starlien95 / Count-GNN
  Learning to Count Isomorphisms with Graph Neural Networks
  ☆13Updated 2 years ago
• ZW-ZHANG / HOPE
  This is a sample implementation of "Asymmetric Transitivity Preserving Graph Embedding"(KDD 2016).
  ☆17Updated 6 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