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.☆214Updated 5 years ago
- Parse the dblp data into a structured format for experimentation.☆75Updated 8 years ago
- Repository for research project that studies influence maximization problem.☆157Updated 10 years ago
- A tensorflow implementation of CommunityGAN (Community Detection with Generative Adversarial Nets)☆79Updated 7 years ago
- NetSMF: Large-Scale Network Embedding as Sparse Matrix Factorization☆133Updated 3 years ago
- Code for the AAAI 2018 Paper "HARP: Hierarchical Representation Learning for Networks"☆116Updated 2 years ago
- Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec☆186Updated 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…☆119Updated 2 years ago
- KDD Course Project - Implementation of Community Detection Algorithms and Evaluations and Some Datasets (港科博一时候KDD课程作业) - by Shixuan Sun …☆42Updated 7 years ago
- ANRL: Attributed Network Representation Learning via Deep Neural Networks(IJCAI-2018)☆88Updated 2 years ago
- embedding attributed graphs☆57Updated 4 years ago
- BiNE: Bipartite Network Embedding☆229Updated 5 years ago
- This repository provides a reference implementation of struc2vec.☆395Updated 2 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
- Representation learning-based graph alignment based on implicit matrix factorization and structural embeddings☆97Updated 4 years ago
- This is a sample implementation of "Asymmetric Transitivity Preserving Graph Embedding"(KDD 2016).☆17Updated 7 years ago
- Source Code for IJCAI 2018 paper "Scalable Multiplex Network Embedding"☆76Updated 5 years ago
- Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures☆133Updated 4 years ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆55Updated 8 years ago
- Heterogeneous information network representation learning☆161Updated 6 years ago
- Implements the bigCLAM algorithm☆51Updated 6 years ago
- Heterogeneous Information Network Embedding☆199Updated 4 years ago
- A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs☆27Updated 10 years ago
- Co-embedding Attributed Networks☆65Updated 5 years ago
- ☆174Updated 6 years ago
- Dynamic Network Embedding by Modeling Triadic Closure Process☆143Updated 6 years ago
- Open Resources For network embedding☆15Updated 5 years ago
- Implementation of ComE algorithm☆59Updated 3 years ago
- Label Informed Attributed Network Embedding, WSDM 2017☆37Updated 6 years ago
- TensorFlow implementation of paper "LINE: Large-scale Information Network Embedding" by Jian Tang, et al.☆203Updated 7 years ago