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 7 years ago
- Python implementation of closed frequent subgraph mining algorithm cgSpan. Only undirected graphs are currently supported.☆10Updated 3 years ago
- Finding statistically significant subgraphs while correcting for multiple testing☆8Updated 9 years ago
- Distributed Graph Mining on a Massive "Single" Graph☆15Updated 5 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 5 years ago
- GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning☆26Updated 3 years ago
- Graph partitioning for distributed GNN training☆14Updated 2 years ago
- Parallel Frequent Subgraph Mining☆31Updated 7 years ago
- ☆12Updated 7 years ago
- Contrast Subgraph Mining from Coherent Cores☆13Updated 7 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
- SSumM: Sparse Summarization of Massive Graphs☆19Updated 5 years ago
- ☆15Updated 8 years ago
- Algorithms to list k-cliques in real-world graphs☆26Updated 4 years ago
- official code for I2GNN.☆13Updated 2 years ago
- A framework for evaluating community mining algorithms.☆11Updated 9 years ago
- gSpan, an efficient algorithm for mining frequent subgraphs☆18Updated 5 years ago
- Tools for the generation, analysis and visualisation of complex networks in hyperbolic space.☆27Updated 6 years ago
- Subgraph matching and isomorphisms in Python.☆27Updated 2 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆26Updated 3 years ago
- The SEMB library is an easy-to-use tool for getting and evaluating structural node embeddings in graphs.☆17Updated 2 years ago
- OpenMP-based parallel software for computing the truss decomposition of a graph.☆14Updated 7 years ago
- Graph kernels☆56Updated 3 years ago
- Local Community Detection in Multiple Netwrks☆14Updated 3 months ago
- C++ library for graph kernel and edit distance algorithm☆15Updated 6 years ago
- gBolt--very fast implementation for gSpan algorithm in data mining☆57Updated 3 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 6 years ago
- The repo lists papers of various areas, including Graph Analytics, Graph Acceleration, Subgraph Matching, Streaming Graph Management, Wor…☆16Updated 4 years ago
- ☆8Updated 5 years ago
- Taxonomy of Benchmarks in Graph Representation Learning☆19Updated 2 years ago