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.
☆21Updated 7 years ago
Alternatives and similar repositories for gSpan
Users that are interested in gSpan are comparing it to the libraries listed below
Sorting:
- Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.☆213Updated 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…☆118Updated last year
- A tensorflow implementation of CommunityGAN (Community Detection with Generative Adversarial Nets)☆79Updated 6 years ago
- Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec☆186Updated 5 years ago
- Repository for research project that studies influence maximization problem.☆158Updated 10 years ago
- Code for the AAAI 2018 Paper "HARP: Hierarchical Representation Learning for Networks"☆116Updated 2 years ago
- A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs☆27Updated 10 years ago
- A NetworkX implementation of Label Propagation from a "Near Linear Time Algorithm to Detect Community Structures in Large-Scale Networks"…☆125Updated 3 years ago
- This repository provides a reference implementation of struc2vec.☆395Updated 2 years ago
- pytorch implementation of structure2vec (https://arxiv.org/abs/1603.05629)☆312Updated 6 years ago
- Parse the dblp data into a structured format for experimentation.☆75Updated 8 years ago
- Open Resources For network embedding☆15Updated 5 years ago
- ☆174Updated 6 years ago
- gSpan, an efficient algorithm for mining frequent subgraphs☆19Updated 5 years ago
- ANRL: Attributed Network Representation Learning via Deep Neural Networks(IJCAI-2018)☆88Updated 2 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆82Updated 7 years ago
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆164Updated 5 years ago
- NetSMF: Large-Scale Network Embedding as Sparse Matrix Factorization☆133Updated 3 years ago
- embedding attributed graphs☆57Updated 4 years ago
- KDD Course Project - Implementation of Community Detection Algorithms and Evaluations and Some Datasets (港科博一时候KDD课程作业) - by Shixuan Sun …☆42Updated 7 years ago
- Implementation of ComE algorithm☆59Updated 3 years ago
- Awesome Graph Embedding Techinques☆60Updated 7 years ago
- Implementation of the paper "Community Detection with Graph Neural Networks", [1] in Pytorch☆35Updated 7 years ago
- Implements the bigCLAM algorithm☆51Updated 6 years ago
- This is the official implementation of "Arbitrary-Order Proximity Preserved Network Embedding"(KDD 2018).☆38Updated 6 years ago
- Some overlapping community detection algorithms (Until 2016). by Yulin Che (https://github.com/CheYulin) for the PhD qualification exam (…☆211Updated 3 years ago
- Heterogeneous information network representation learning☆162Updated 6 years ago
- Representation learning-based graph alignment based on implicit matrix factorization and structural embeddings☆97Updated 4 years ago
- Deep Neural Networks Based Approaches for Graph Embeddings☆26Updated 8 years ago
- A Repository of Benchmark Graph Datasets for Graph Classification (31 Graph Datasets In Total).☆296Updated 3 years ago