Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.
☆216Dec 2, 2020Updated 5 years ago
Alternatives and similar repositories for gSpan
Users that are interested in gSpan are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- gSpan, an efficient algorithm for mining frequent subgraphs☆20Jan 4, 2020Updated 6 years ago
- gBolt--very fast implementation for gSpan algorithm in data mining☆60Jul 15, 2021Updated 4 years ago
- Graph Embedding via Frequent Subgraphs☆45May 5, 2020Updated 6 years ago
- A fork of Sebastian Nowozin's and Koji Tsuda's gboost code☆16Mar 5, 2013Updated 13 years ago
- ☆366Jun 25, 2024Updated last year
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- Distributed Graph Mining on a Massive "Single" Graph☆15Mar 28, 2020Updated 6 years ago
- Repository for RuDiK, a system for discovering declarative logical rules over RDF Knowledge Bases☆27May 8, 2024Updated 2 years ago
- "Explainable classification of brain networks via contrast subgraphs" - T. Lanciano, F. Bonchi, A. Gionis☆21Mar 23, 2022Updated 4 years ago
- ☆24Nov 12, 2015Updated 10 years ago
- ☆11Jun 21, 2022Updated 3 years ago
- Approximate subgraph motif mining through learnable edge contraction.☆15Aug 3, 2023Updated 2 years ago
- A scikit-learn compatible library for graph kernels☆642Jul 26, 2025Updated 10 months ago
- Local Community Detection in Multiple Netwrks☆16Feb 27, 2025Updated last year
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆166Oct 26, 2023Updated 2 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Package to evaluate network-propagation-based similarity measures between nodes in a networkX graph☆10Jul 31, 2018Updated 7 years ago
- ☆27Oct 29, 2024Updated last year
- ☆19Apr 30, 2022Updated 4 years ago
- Bunch of aproximated graph edit distance algorithms.☆36Jun 28, 2018Updated 7 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆89Sep 1, 2024Updated last year
- Fast graph-regularized matrix factorization☆20Oct 3, 2023Updated 2 years ago
- llvm Data Flow Graph dump☆36May 24, 2021Updated 5 years ago
- Simple passes for CFG and DFG analysis☆44Jul 8, 2019Updated 6 years ago
- Graph kernels☆56Dec 3, 2025Updated 6 months ago
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- The implementation for "Open Relation Modeling: Learning to Define Relations between Entities" (Findings of ACL '22)☆12Feb 28, 2022Updated 4 years ago
- Global Counterfactual Explainer for Graph Neural Networks☆22Mar 24, 2023Updated 3 years ago
- Released code for [sigmod'21] A learned Sketch for Subgraph Counting☆22Sep 26, 2021Updated 4 years ago
- ☆16Oct 13, 2020Updated 5 years ago
- Code and experiments for the paper "A Partitioning Algorithm for Maximum Common Subgraph Problems"☆15Jun 17, 2020Updated 6 years ago
- Benchmark for Graph Embedding Methods☆49Dec 7, 2020Updated 5 years ago
- Segmented Code Adjustment Quantization (SAQ)☆25Sep 22, 2025Updated 8 months ago
- OOPSLA 2019 Artifact for AutoPandas. Website at https://rbavishi.github.io/autopandas☆31Nov 21, 2022Updated 3 years ago
- ☆34Mar 24, 2023Updated 3 years ago
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- Attributed graph datasets with ground truth clusters☆12Aug 9, 2022Updated 3 years ago
- Four of the main kernels on graphs Python implementation.☆16Feb 5, 2017Updated 9 years ago
- A margin based online learning algorithm for binary classification.☆17Feb 5, 2019Updated 7 years ago
- This paper is accpeted by WSDM 2023☆13Mar 13, 2023Updated 3 years ago
- Implementation of the Multiscale Laplacian Graph Kernel☆19Nov 21, 2019Updated 6 years ago
- Argumentative microtexts annotated with RST, SDRT and argumentation structure☆12Jun 19, 2016Updated 9 years ago
- A graph matching library for Python☆210Apr 25, 2024Updated 2 years ago