nphdang / gSpan
gSpan, an efficient algorithm for mining frequent subgraphs
☆18Updated 5 years ago
Alternatives and similar repositories for gSpan:
Users that are interested in gSpan are comparing it to the libraries listed below
- Parallel Frequent Subgraph Mining☆31Updated 7 years ago
- 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
- Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.☆201Updated 4 years ago
- Frequent subgraph mining using FFSM algorithm, C++☆11Updated 7 years ago
- This is a python implementation of the Gaston frequent subgraph mining algorithm.☆20Updated 5 years ago
- Graph Embedding via Frequent Subgraphs☆45Updated 4 years ago
- The ParSeMiS project (Parallel and Sequential Graph Mining Suite) searches for frequent, interesting substructures in graph databases. ht…☆44Updated 5 years ago
- 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
- Representation learning-based graph alignment based on implicit matrix factorization and structural embeddings☆95Updated 4 years ago
- A collection of graph classification methods☆42Updated 4 years ago
- ☆94Updated 2 years ago
- Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"☆53Updated 8 months ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆154Updated last year
- This repository contains research into the use of graph partitioning algorithms for assigning people shelters based on their social netwo…☆18Updated 5 years ago
- An Implementation of 1-Weisfeiler-Lehman Algorithm using Deep Graph Library☆9Updated 4 years ago
- Scalable Graph Neural Networks for Heterogeneous Graphs☆71Updated 4 years ago
- ☆17Updated 4 years ago
- Implement of DiGCN, NeurIPS-2020☆47Updated 3 years ago
- The official implementation of ''Can Graph Neural Networks Count Substructures?'' NeurIPS 2020☆34Updated 4 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 6 years ago
- Python implementation of closed frequent subgraph mining algorithm cgSpan. Only undirected graphs are currently supported.☆10Updated 3 years ago
- gBolt--very fast implementation for gSpan algorithm in data mining☆57Updated 3 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- GraphZoom: A Multi-level Spectral Approach for Accurate and Scalable Graph Embedding☆114Updated 2 years ago
- DrBC: A novel graph neural network approach to identify high Betweenness Centraliy (BC) nodes ( CIKM'19 )☆31Updated 4 years ago
- bipartite-graph-learning☆30Updated 5 years ago
- ☆349Updated 9 months ago
- Code for NeurIPS'19 "Layer-Dependent Importance Sampling for Training Deep and Large Graph Convolutional Networks"☆76Updated 2 years ago
- LDP for graph classification☆23Updated 5 years ago
- code for the paper in NeurIPS 2019☆40Updated 2 years ago