ChristalC / Frequent-Subgraph-MiningLinks
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
Sorting:
- graph-based substructure pattern mining algorithm (authors: Xifeng Yan, Jiawei Han) implementation☆11Updated 8 years ago
- Finding statistically significant subgraphs while correcting for multiple testing☆8Updated 9 years ago
- Python implementation of closed frequent subgraph mining algorithm cgSpan. Only undirected graphs are currently supported.☆10Updated 3 years ago
- Parallel Frequent Subgraph Mining☆31Updated 7 years ago
- Distributed Graph Mining on a Massive "Single" Graph☆15Updated 5 years ago
- Subgraph matching and isomorphisms in Python.☆27Updated 2 years ago
- Graph partitioning for distributed GNN training☆14Updated 2 years ago
- Contrast Subgraph Mining from Coherent Cores☆13Updated 7 years ago
- gSpan, an efficient algorithm for mining frequent subgraphs☆19Updated 5 years ago
- GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning☆26Updated 4 years ago
- The reference implementation of FEATHER from the CIKM '20 paper "Characteristic Functions on Graphs: Birds of a Feather, from Statistical…☆51Updated 2 years ago
- This repository contains research into the use of graph partitioning algorithms for assigning people shelters based on their social netwo…☆18Updated 6 years ago
- ☆25Updated 4 years ago
- Implementation of the depth-first gSpan algorithm for frequent graph mining in graphs data set. Finds possible frequent and canonical ext…☆19Updated 7 years ago
- gBolt--very fast implementation for gSpan algorithm in data mining☆58Updated 3 years ago
- SSumM: Sparse Summarization of Massive Graphs☆19Updated 5 years ago
- Fast and Scalable Method for Distributed Boolean Tensor Factorization (ICDE'17 & VLDBJ'19)☆6Updated 6 years ago
- ☆16Updated 5 years ago
- ☆12Updated 7 years ago
- Approximate subgraph motif mining through learnable edge contraction.☆13Updated last year
- GraMi is a novel framework for frequent subgraph mining in a single large graph, GraMi outperforms existing techniques by 2 orders of ma…☆113Updated last year
- A fork of Sebastian Nowozin's and Koji Tsuda's gboost code☆17Updated 12 years ago
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆16Updated 5 years ago
- A framework for evaluating community mining algorithms.☆11Updated 9 years ago
- ☆46Updated 2 months ago
- Geo2DR: A Python and PyTorch library for learning distributed representations of graphs.☆46Updated last year
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆61Updated 4 years ago
- G3: A Programmable GNN Training System on GPU☆43Updated 4 years ago
- Graph kernels☆56Updated 3 years ago
- This is a python implementation of the Gaston frequent subgraph mining algorithm.☆20Updated 5 years ago