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 7 years ago
Alternatives and similar repositories for gSpan:
Users that are interested in gSpan are comparing it to the libraries listed below
- Graph Embedding via Frequent Subgraphs☆45Updated 5 years ago
- This is a python implementation of the Gaston frequent subgraph mining algorithm.☆20Updated 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
- Multi-Graph Multi-Label Learning☆11Updated 6 years ago
- Python implementation of closed frequent subgraph mining algorithm cgSpan. Only undirected graphs are currently supported.☆10Updated 3 years ago
- gSpan, an efficient algorithm for mining frequent subgraphs☆18Updated 5 years ago
- Benchmark for Graph Embedding Methods☆47Updated 4 years ago
- Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.☆201Updated 4 years ago
- Code for PAKDD-2018 paper "MetaGraph2Vec: Complex Semantic Path Augmented Heterogeneous Network Embedding"☆22Updated 6 years ago
- Awesome Graph Embedding Techinques☆60Updated 6 years ago
- node2vec implementation in C++☆52Updated 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
- embedding attributed graphs☆57Updated 3 years ago
- Representation learning-based graph alignment based on implicit matrix factorization and structural embeddings☆95Updated 4 years ago
- Large Scale Graphical Model☆24Updated 6 years ago
- Contains the code (and working vm setup) for our KDD MLG 2016 paper titled: "subgraph2vec: Learning Distributed Representations of Rooted…☆42Updated 8 years ago
- ☆35Updated 7 years ago
- Semi-supervised User Geolocation via Graph Convolutional Networks☆67Updated 4 years ago
- This is a sample implementation of "Asymmetric Transitivity Preserving Graph Embedding"(KDD 2016).☆17Updated 6 years ago
- Code for the AAAI 2018 Paper "HARP: Hierarchical Representation Learning for Networks"☆116Updated last year
- Code to reproduce results in "Finding Streams in Knowledge Graphs to Support Fact Checking"☆35Updated last week
- Companion repository for the KDD'18 hands-on tutorial on Higher-Order Data Analytics for Temporal Network Data☆45Updated 6 years ago
- Graph Recurrent Networks with Attributed Random Walks☆28Updated last year
- Learning to represent shortest paths and other graph-based measures of node similarities with graph embeddings☆33Updated 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
- Code for the paper "Unsupervised Community Detection with Modularity-based Attention Model"☆36Updated 4 years ago
- Label Informed Attributed Network Embedding, WSDM 2017☆37Updated 6 years ago
- A NetworkX implementation of Label Propagation from a "Near Linear Time Algorithm to Detect Community Structures in Large-Scale Networks"…☆124Updated 2 years ago
- Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures☆130Updated 4 years ago
- Learning node representation using edge semantics☆53Updated 5 years ago