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
- This is a python implementation of the Gaston frequent subgraph mining algorithm.☆20Updated 5 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…☆111Updated last year
- Frequent subgraph mining using FFSM algorithm, C++☆11Updated 7 years ago
- Parallel Frequent Subgraph Mining☆30Updated 7 years ago
- ☆17Updated 4 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
- gBolt--very fast implementation for gSpan algorithm in data mining☆55Updated 3 years ago
- Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.☆200Updated 4 years ago
- graph-based substructure pattern mining algorithm (authors: Xifeng Yan, Jiawei Han) implementation☆11Updated 7 years ago
- Graph Embedding via Frequent Subgraphs☆44Updated 4 years ago
- Distributed Graph Mining on a Massive "Single" Graph☆14Updated 4 years ago
- FORA: Simple and Effective Approximate Single-Source Personalized Pagerank☆31Updated 4 years ago
- Code for Influence Maximization Problem☆27Updated 7 years ago
- DrBC: A novel graph neural network approach to identify high Betweenness Centraliy (BC) nodes ( CIKM'19 )☆31Updated 4 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 5 years ago
- Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"☆53Updated 7 months ago
- DynaMo: Dynamic Community Detection by Incrementally Maximizing Modularity☆27Updated 3 years ago
- Top-K Influential Nodes in Social Networks: A Game Perspective (SIGIR'17)☆35Updated 11 months ago
- Source code for blog post at https://hautahi.com/im_ris☆11Updated 6 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆24Updated 2 years ago
- ☆26Updated 2 years ago
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆162Updated 4 years ago
- Scalable Graph Neural Networks for Heterogeneous Graphs☆72Updated 4 years ago
- ☆24Updated 2 years ago
- The official implementation of ''Can Graph Neural Networks Count Substructures?'' NeurIPS 2020☆34Updated 4 years ago
- A Broader Picture of Random-walk Based Graph Embedding☆30Updated 3 years ago
- ☆61Updated 2 years ago
- A fork of Sebastian Nowozin's and Koji Tsuda's gboost code☆17Updated 11 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆150Updated last year
- Largest realworld open-source graph dataset - Worked done under IBM-Illinois Discovery Accelerator Institute and Amazon Research Awards a…☆79Updated 2 months ago