LasseRegin / gSpanLinks
Implementation of the depth-first gSpan algorithm for frequent graph mining in graphs data set. Finds possible frequent and canonical extensions of a given graph from a given set of graphs.
☆18Updated 7 years ago
Alternatives and similar repositories for gSpan
Users that are interested in gSpan are comparing it to the libraries listed below
Sorting:
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆54Updated 7 years ago
- Frequent subgraph mining using FFSM algorithm, C++☆11Updated 7 years ago
- graph-based substructure pattern mining algorithm (authors: Xifeng Yan, Jiawei Han) implementation☆11Updated 7 years ago
- gSpan, an efficient algorithm for mining frequent subgraphs☆18Updated 5 years ago
- The source codes for D2AGE model. Distance-aware DAG Embedding for Proximity Search on Heterogeneous Graphs.☆12Updated 7 years ago
- Dynamic Youtube graphs☆27Updated 5 years ago
- This is a sample implementation of "Asymmetric Transitivity Preserving Graph Embedding"(KDD 2016).☆17Updated 6 years ago
- Multiple Local Community Detection☆17Updated 7 years ago
- Code and data for paper AspEm: Embedding Learning by Aspects in Heterogeneous Information Networks☆25Updated 7 years ago
- ☆51Updated 8 years ago
- Code for the paper "Unsupervised Community Detection with Modularity-based Attention Model"☆36Updated 5 years ago
- Learning node representation using edge semantics☆53Updated 5 years ago
- The implementation that infers the temporal latent spaces for a sequence of dynamic graph snapshots☆64Updated 7 years ago
- Community Detection Based on Structure and Content☆12Updated 6 years ago
- A fork of Sebastian Nowozin's and Koji Tsuda's gboost code☆17Updated 12 years ago
- Implementation of Influence Maximisation on a graph dataset.☆15Updated 6 years ago
- A tensorflow implementation of CommunityGAN (Community Detection with Generative Adversarial Nets)☆79Updated 6 years ago
- Contrast Subgraph Mining from Coherent Cores☆13Updated 7 years ago
- DynaMo: Dynamic Community Detection by Incrementally Maximizing Modularity☆28Updated 3 years ago
- Implementation of the paper "Community Detection with Graph Neural Networks", by J. Bruna and L. Li☆74Updated 8 years ago
- Community Detection in Graphs (master's degree short project)☆40Updated 3 years ago
- A novel approach to evaluate community detection algorithms on ground truth☆22Updated 3 years ago
- Graph Embedding via Frequent Subgraphs☆45Updated 5 years ago
- Implementation of "Bayesian Robust Attributed Graph Clustering: Joint Learning of Partial Anomalies and Group Structure".☆24Updated 5 years ago
- embedding attributed graphs☆57Updated 3 years ago
- Implementation of the paper "Community Detection with Graph Neural Networks", [1] in Pytorch☆37Updated 7 years ago
- Finding community structure in very large networks, by Clauset-Newman-Moore☆15Updated 7 years ago
- Semi-supervised User Geolocation via Graph Convolutional Networks☆67Updated 4 years ago
- Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.☆202Updated 4 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