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.
  ☆208Updated 4 years ago
• SamJia / CommunityGAN
  A tensorflow implementation of CommunityGAN (Community Detection with Generative Adversarial Nets)
  ☆79Updated 6 years ago
• google / gcnn-survey-paper
  ☆173Updated 5 years ago
• xptree / NetMF
  Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec
  ☆186Updated 5 years ago
• xptree / NetSMF
  NetSMF: Large-Scale Network Embedding as Sparse Matrix Factorization
  ☆132Updated 3 years ago
• yaolili / VF2
  A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs
  ☆27Updated 9 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…
  ☆117Updated last year
• rkwitt / gboost
  A fork of Sebastian Nowozin's and Koji Tsuda's gboost code
  ☆17Updated 12 years ago
• GTmac / HARP
  Code for the AAAI 2018 Paper "HARP: Hierarchical Representation Learning for Networks"
  ☆116Updated 2 years ago
• thu-ml / stochastic_gcn
  Stochastic training of graph convolutional networks
  ☆84Updated 3 years ago
• GemsLab / REGAL
  Representation learning-based graph alignment based on implicit matrix factorization and structural embeddings
  ☆97Updated 4 years ago
• facebookresearch / NARS
  Scalable Graph Neural Networks for Heterogeneous Graphs
  ☆72Updated 4 years ago
• nphdang / gSpan
  gSpan, an efficient algorithm for mining frequent subgraphs
  ☆19Updated 5 years ago
• nd7141 / influence-maximization
  Repository for research project that studies influence maximization problem.
  ☆159Updated 10 years ago
• Ashish7129 / Graph_Sampling
  Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.
  ☆163Updated 4 years ago
• snash4 / GAT2VEC
  embedding attributed graphs
  ☆57Updated 3 years ago
• acbull / LADIES
  Code for NeurIPS'19 "Layer-Dependent Importance Sampling for Training Deep and Large Graph Convolutional Networks"
  ☆76Updated 2 years ago
• snap-stanford / distance-encoding
  Distance Encoding for GNN Design
  ☆187Updated 4 years ago
• nd7141 / AWE
  Compute graph embeddings via Anonymous Walk Embeddings
  ☆83Updated 7 years ago
• yifan-h / CS-GNN
  Measuring and Improving the Use of Graph Information in Graph Neural Networks
  ☆83Updated last year
• xhuang31 / LANE
  Label Informed Attributed Network Embedding, WSDM 2017
  ☆37Updated 6 years ago
• RobRomijnders / bigclam
  Implements the bigCLAM algorithm
  ☆52Updated 5 years ago
• graph-star-team / graph_star
  Graph Star Net
  ☆110Updated 2 years ago
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆160Updated last year
• HKUST-KnowComp / NeuralSubgraphCounting
  Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"
  ☆54Updated last year
• YixuanLi / LEMON
  LEMON: A local algorithm for fast, high-precision overlapping community detection
  ☆55Updated 8 years ago
• hwwang55 / GCN-LPA
  A tensorflow implementation of GCN-LPA
  ☆99Updated 5 years ago
• danielzuegner / netgan
  Implementation of the paper "NetGAN: Generating Graphs via Random Walks".
  ☆196Updated 4 years ago
• andompesta / ComE
  Implementation of ComE algorithm
  ☆59Updated 3 years ago
• wangsibovictor / fora
  FORA: Simple and Effective Approximate Single-Source Personalized Pagerank
  ☆32Updated 4 years ago