ChristalC / Frequent-Subgraph-Mining
Frequent subgraph mining using FFSM algorithm, C++
☆10Updated 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☆10Updated 7 years ago
- Graph partitioning for distributed GNN training☆12Updated last year
- This is a python implementation of the Gaston frequent subgraph mining algorithm.☆19Updated 4 years ago
- Subgraph matching and isomorphisms in Python.☆27Updated 2 years ago
- Parallel Frequent Subgraph Mining☆29Updated 7 years ago
- gSpan, an efficient algorithm for mining frequent subgraphs☆18Updated 5 years ago
- [VLDB'23] SUREL+ is a novel set-based computation framework for scalable subgraph-based graph representation learning.☆17Updated last year
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 4 years ago
- GLSearch: Maximum Common Subgraph Detection via Learning to Search☆22Updated last year
- gBolt--very fast implementation for gSpan algorithm in data mining☆53Updated 3 years ago
- Implementation of the fastPFP approximate subgraph matching algorithm, as described in http://arxiv.org/abs/1207.1114☆11Updated 9 years ago
- Wasserstein Distance Graph Alignment☆22Updated 3 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆24Updated 2 years ago
- Finding statistically significant subgraphs while correcting for multiple testing☆7Updated 9 years ago
- ☆16Updated 4 years ago
- Distributed Graph Mining on a Massive "Single" Graph☆13Updated 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
- Graph kernels☆56Updated 3 years ago
- official code for I2GNN.☆12Updated last year
- ☆16Updated 8 years ago
- Experiments with Message Passing GNNs in C++ and PyTorch.☆24Updated 5 months ago
- Official repository for the paper "Partition and Code: learning how to compress graphs" (NeurIPS'21) https://arxiv.org/abs/2107.01952☆32Updated 3 years ago
- A Python implementation of a fast approximation of the Weisfeiler-Lehman Graph Kernels.☆23Updated 5 years ago
- Core Decomposition in Multilayer Networks: Theory, Algorithms, and Applications☆11Updated 6 years ago
- ☆13Updated 6 years ago
- Graph Neural Network☆19Updated 3 years ago
- Algorithms to list k-cliques in real-world graphs☆25Updated 3 years ago
- SSumM: Sparse Summarization of Massive Graphs☆19Updated 4 years ago
- This repo contains the experiments performed for link prediction, multi-class classification and pairwise node classification task.☆10Updated 4 years ago