ChristalC / Frequent-Subgraph-Mining
Frequent subgraph mining using FFSM algorithm, C++
☆11Updated 7 years ago
Alternatives and similar repositories for Frequent-Subgraph-Mining:
Users that are interested in Frequent-Subgraph-Mining are comparing it to the libraries listed below
- Python implementation of closed frequent subgraph mining algorithm cgSpan. Only undirected graphs are currently supported.☆10Updated 3 years ago
- graph-based substructure pattern mining algorithm (authors: Xifeng Yan, Jiawei Han) implementation☆11Updated 7 years ago
- Finding statistically significant subgraphs while correcting for multiple testing☆8Updated 9 years ago
- gSpan, an efficient algorithm for mining frequent subgraphs☆18Updated 5 years ago
- Distributed Graph Mining on a Massive "Single" Graph☆14Updated 4 years ago
- Parallel Frequent Subgraph Mining☆30Updated 7 years ago
- Subgraph matching and isomorphisms in Python.☆27Updated 2 years ago
- Graph partitioning for distributed GNN training☆12Updated 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
- This is a python implementation of the Gaston frequent subgraph mining algorithm.☆19Updated 5 years ago
- Contrast Subgraph Mining from Coherent Cores☆13Updated 7 years ago
- Geo2DR: A Python and PyTorch library for learning distributed representations of graphs.☆45Updated last year
- C++ library for graph kernel and edit distance algorithm☆15Updated 6 years ago
- Local community detection code that implements the methods used in Think Locally, Act Locally: The Detection of Small, Medium-Sized, and …☆13Updated 6 years ago
- A package for computing Graph Kernels☆103Updated last year
- SSumM: Sparse Summarization of Massive Graphs☆19Updated 4 years ago
- ☆16Updated 4 years ago
- An easily extensible C++ library for (suboptimally) computing the graph edit distance between attributed graphs.☆59Updated last year
- Implementation of the depth-first gSpan algorithm for frequent graph mining in graphs data set. Finds possible frequent and canonical ext…☆18Updated 6 years ago
- ☆11Updated 7 years ago
- A framework for evaluating community mining algorithms.☆11Updated 8 years ago
- ☆16Updated 8 years ago
- GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning☆26Updated 3 years ago
- Wasserstein Distance Graph Alignment☆22Updated 4 years ago
- official code for I2GNN.☆12Updated last year
- gBolt--very fast implementation for gSpan algorithm in data mining☆55Updated 3 years ago
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆70Updated 2 years ago
- A fork of Sebastian Nowozin's and Koji Tsuda's gboost code☆17Updated 11 years ago
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆16Updated 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