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
- Multi-Graph Multi-Label Learning☆11Updated 6 years ago
- embedding attributed graphs☆58Updated 3 years ago
- The ParSeMiS project (Parallel and Sequential Graph Mining Suite) searches for frequent, interesting substructures in graph databases. ht…☆44Updated 4 years ago
- Graph Embedding via Frequent Subgraphs☆44Updated 4 years ago
- Python implementation of closed frequent subgraph mining algorithm cgSpan. Only undirected graphs are currently supported.☆10Updated 3 years ago
- A fork of Sebastian Nowozin's and Koji Tsuda's gboost code☆17Updated 12 years ago
- gSpan, an efficient algorithm for mining frequent subgraphs☆18Updated 5 years ago
- This is a python implementation of the Gaston frequent subgraph mining algorithm.☆20Updated 5 years ago
- Code and data for paper PReP: Path-Based Relevance from a Probabilistic Perspective in Heterogeneous Information Networks☆16Updated 7 years ago
- Frequent subgraph mining using FFSM algorithm, C++☆11Updated 7 years ago
- Code for the experiments of Matrix Factorization Bandit☆24Updated 6 years ago
- Awesome Graph Embedding Techinques☆58Updated 6 years ago
- gBolt--very fast implementation for gSpan algorithm in data mining☆55Updated 3 years ago
- Bachelor degree research on heterogeneous information network alignment.☆31Updated 5 years ago
- graph-based substructure pattern mining algorithm (authors: Xifeng Yan, Jiawei Han) implementation☆11Updated 7 years ago
- Code and data for paper AspEm: Embedding Learning by Aspects in Heterogeneous Information Networks☆25Updated 6 years ago
- Deep Neural Networks Based Approaches for Graph Embeddings☆26Updated 7 years ago
- ☆35Updated 6 years ago
- Large Scale Graphical Model☆24Updated 6 years ago
- This is a sample implementation of "Asymmetric Transitivity Preserving Graph Embedding"(KDD 2016).☆16Updated 6 years ago
- Link Prediction with Supervised Random Walks on Github Data☆16Updated 9 years ago
- ☆48Updated 2 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
- This repository contains research into the use of graph partitioning algorithms for assigning people shelters based on their social netwo…☆18Updated 5 years ago
- Large Scale Graphical Model☆10Updated 6 years ago
- Bunch of aproximated graph edit distance algorithms.☆33Updated 6 years ago
- Code for Learning K-way D-dimensional Discrete Codes For Compact Embedding Representations☆28Updated 6 years ago
- Semi-supervised User Geolocation via Graph Convolutional Networks☆66Updated 4 years ago
- Implementation of ComE algorithm☆59Updated 2 years ago