LasseRegin / gSpan
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 6 years ago
Alternatives and similar repositories for gSpan:
Users that are interested in gSpan are comparing it to the libraries listed below
- Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.☆200Updated 4 years ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆54Updated 7 years ago
- Multi-Graph Multi-Label Learning☆11Updated 6 years ago
- Algorithms for local community detection in networks☆25Updated 8 years ago
- Frequent subgraph mining using FFSM algorithm, C++☆11Updated 7 years ago
- This is a sample implementation of "Asymmetric Transitivity Preserving Graph Embedding"(KDD 2016).☆16Updated 6 years ago
- Awesome Graph Embedding Techinques☆58Updated 6 years ago
- This is a python implementation of the Gaston frequent subgraph mining algorithm.☆19Updated 5 years ago
- 1) SimRank (single pair query, parallel all pair computation / dynamic updates) - by Yue Wang (https://github.com/KeithYue) and Yulin Che…☆14Updated 4 years ago
- embedding attributed graphs☆58Updated 3 years ago
- Deep Neural Networks Based Approaches for Graph Embeddings☆26Updated 7 years ago
- Text-to-network based datasets.☆8Updated 5 years ago
- Large Scale Graphical Model☆24Updated 6 years ago
- ☆8Updated 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…☆111Updated last year
- Python Benchmarking Framework for the Clustering Algorithms Evaluation: networks generation and shuffling; failover execution and resourc…☆19Updated 6 years ago
- A tensorflow implementation of CommunityGAN (Community Detection with Generative Adversarial Nets)☆79Updated 6 years ago
- Community Detection in Graphs (master's degree short project)☆40Updated 2 years ago
- Open Resources For network embedding☆15Updated 4 years ago
- gSpan, an efficient algorithm for mining frequent subgraphs☆18Updated 5 years ago
- Implementation code for ICML '17 paper "Deep Temporal Reasoning for Dynamic Knowledge Graphs"☆110Updated 6 years ago
- Learning to represent shortest paths and other graph-based measures of node similarities with graph embeddings☆33Updated 5 years ago
- Implementation of the paper "Community Detection with Graph Neural Networks", by J. Bruna and L. Li☆73Updated 7 years ago
- Contrast Subgraph Mining from Coherent Cores☆13Updated 7 years ago
- Subgraph matching and isomorphisms in Python.☆27Updated 2 years ago
- Market Survey: Community Detection☆70Updated 7 years ago
- ☆28Updated 6 years ago
- Code for PAKDD-2018 paper "MetaGraph2Vec: Complex Semantic Path Augmented Heterogeneous Network Embedding"☆21Updated 6 years ago
- KDD Course Project - Implementation of Community Detection Algorithms and Evaluations and Some Datasets (港科博一时候KDD课程作 业) - by Shixuan Sun …☆43Updated 6 years ago
- Network Representation Learning with Rich Text Information (IJCAI 2015)☆47Updated 7 years ago