nphdang / gSpanLinks
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
Sorting:
- 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
- Parallel Frequent Subgraph Mining☆31Updated 7 years ago
- This is a python implementation of the Gaston frequent subgraph mining algorithm.☆20Updated 5 years ago
- Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.☆202Updated 4 years ago
- DrBC: A novel graph neural network approach to identify high Betweenness Centraliy (BC) nodes ( CIKM'19 )☆32Updated 4 years ago
- Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"☆54Updated 10 months ago
- Knowledge Graph summarization for anomaly/error detection & completion (WebConf '20)☆39Updated 4 years ago
- Advancing GraphSAGE with A Data-driven Node Sampling☆26Updated 2 years ago
- ☆33Updated 2 years ago
- Graph Embedding via Frequent Subgraphs☆45Updated 5 years ago
- The ParSeMiS project (Parallel and Sequential Graph Mining Suite) searches for frequent, interesting substructures in graph databases. ht…☆44Updated 5 years ago
- Code for Influence Maximization Problem☆29Updated 7 years ago
- A Broader Picture of Random-walk Based Graph Embedding☆30Updated 3 years ago
- Graph Neural Networks for Community Detection☆63Updated 5 years ago
- Representation learning-based graph alignment based on implicit matrix factorization and structural embeddings☆95Updated 4 years ago
- A tensorflow implementation of CommunityGAN (Community Detection with Generative Adversarial Nets)☆79Updated 6 years ago
- ☆15Updated 3 years ago
- Scalable Graph Neural Networks for Heterogeneous Graphs☆72Updated 4 years ago
- Implementation of Influence Maximisation on a graph dataset.☆15Updated 6 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 6 years ago
- Code for the KDD 2021 paper "Scaling Up Graph Neural Networks Via Graph Coarsening"☆28Updated last year
- 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
- ☆25Updated 4 years ago
- Code for "Heterogeneous Graph Transformer" (WWW'20), which is based on Deep Graph Library (DGL)☆74Updated 2 years ago
- Source code for CIKM 2019 paper "Temporal Network Embedding with Micro- and Macro-dynamics"☆37Updated 3 years ago
- Code, datasets & supplementary for "Structural Patterns and Generative Models of Real-world Hypergraphs"☆31Updated 7 months ago
- ☆12Updated 7 years ago
- Frequent subgraph mining using FFSM algorithm, C++☆11Updated 7 years ago
- DynaMo: Dynamic Community Detection by Incrementally Maximizing Modularity☆28Updated 3 years ago
- Code for benhcmarking 12 state-of-the-art methods in the field of Influence Maximization☆19Updated 8 years ago