nphdang / gSpan
gSpan, an efficient algorithm for mining frequent subgraphs
☆17Updated 4 years ago
Related projects ⓘ
Alternatives and complementary repositories for gSpan
- This is a python implementation of the Gaston frequent subgraph mining algorithm.☆18Updated 4 years ago
- DrBC: A novel graph neural network approach to identify high Betweenness Centraliy (BC) nodes ( CIKM'19 )☆30Updated 3 years ago
- Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.☆198Updated 3 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 10 months ago
- Representation learning-based graph alignment based on implicit matrix factorization and structural embeddings☆92Updated 3 years ago
- Parallel Frequent Subgraph Mining☆28Updated 7 years ago
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆160Updated 3 years ago
- Knowledge Graph summarization for anomaly/error detection & completion (WebConf '20)☆36Updated 4 years ago
- Graph Embedding via Frequent Subgraphs☆44Updated 4 years ago
- The ParSeMiS project (Parallel and Sequential Graph Mining Suite) searches for frequent, interesting substructures in graph databases. ht…☆44Updated 4 years ago
- Python implementation of closed frequent subgraph mining algorithm cgSpan. Only undirected graphs are currently supported.☆9Updated 2 years ago
- Implementation of the paper "Certifiable Robustness and Robust Training for Graph Convolutional Networks".☆42Updated 3 years ago
- DRUM end to end differentiable rule mining on knowledge graphs☆51Updated 3 years ago
- An Implementation of 1-Weisfeiler-Lehman Algorithm using Deep Graph Library☆9Updated 4 years ago
- Code for the KDD 2021 paper "Scaling Up Graph Neural Networks Via Graph Coarsening"☆25Updated 5 months ago
- Scalable Graph Neural Networks for Heterogeneous Graphs☆72Updated 3 years ago
- Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"☆52Updated 3 months ago
- Subgraph matching and isomorphisms in Python.☆27Updated 2 years ago
- Source code for our IEEE ICDM 2017 paper "Glocalized Weisfeiler-Lehman Graph Kernels: Global-Local Feature Maps of Graphs".☆11Updated 7 years ago
- Code for Influence Maximization Problem☆27Updated 7 years ago
- Implement of DiGCN, NeurIPS-2020☆45Updated 3 years ago
- Code for "Heterogeneous Graph Transformer" (WWW'20), which is based on Deep Graph Library (DGL)☆70Updated 2 years ago
- ☆13Updated 8 years ago
- 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
- This is the official implementation of "Arbitrary-Order Proximity Preserved Network Embedding"(KDD 2018).☆38Updated 5 years ago
- first commit☆15Updated 4 years ago
- The source code for NeurIPS 2020 paper "Graph Policy Network for Transferable Active Learning on Graphs"☆44Updated 4 years ago
- ☆60Updated last year
- Code for the paper "Unsupervised Community Detection with Modularity-based Attention Model"☆36Updated 4 years ago
- Generating PGM Explanation for GNN predictions☆73Updated last year