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:
- This is a python implementation of the Gaston frequent subgraph mining algorithm.☆24Feb 3, 2020Updated 6 years ago
- Implementation of the depth-first gSpan algorithm for frequent graph mining in graphs data set. Finds possible frequent and canonical ext…☆21Apr 10, 2018Updated 8 years ago
- Python implementation of closed frequent subgraph mining algorithm cgSpan. Only undirected graphs are currently supported.☆13Dec 20, 2021Updated 4 years ago
- gBolt--very fast implementation for gSpan algorithm in data mining☆60Jul 15, 2021Updated 4 years ago
- The ParSeMiS project (Parallel and Sequential Graph Mining Suite) searches for frequent, interesting substructures in graph databases. ht…☆46Mar 19, 2020Updated 6 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.
- Graph Embedding via Frequent Subgraphs☆45May 5, 2020Updated 6 years ago
- A fork of Sebastian Nowozin's and Koji Tsuda's gboost code☆17Mar 5, 2013Updated 13 years ago
- Frequent subgraph mining using FFSM algorithm, C++☆11Jan 15, 2018Updated 8 years ago
- ☆366Jun 25, 2024Updated last year
- ☆11Jun 21, 2022Updated 3 years ago
- Approximate subgraph motif mining through learnable edge contraction.☆15Aug 3, 2023Updated 2 years ago
- Multi-Graph Multi-Label Learning☆11May 30, 2018Updated 7 years ago
- A scikit-learn compatible library for graph kernels☆641Jul 26, 2025Updated 9 months ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆12Apr 6, 2020Updated 6 years ago
- Managed Kubernetes at scale on DigitalOcean • AdDigitalOcean Kubernetes includes the control plane, bandwidth allowance, container registry, automatic updates, and more for free.
- ☆19Apr 30, 2022Updated 4 years ago
- ☆25Aug 15, 2020Updated 5 years ago
- A fast MATLAB implementation of the Weisfeiler--Lehman graph transformation and associated kernel.☆11Oct 25, 2017Updated 8 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆88Sep 1, 2024Updated last year
- Fast graph-regularized matrix factorization☆20Oct 3, 2023Updated 2 years ago
- Graph kernels☆56Dec 3, 2025Updated 5 months ago
- 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☆21Sep 26, 2021Updated 4 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- ☆16Oct 13, 2020Updated 5 years ago
- Code and experiments for the paper "A Partitioning Algorithm for Maximum Common Subgraph Problems"☆15Jun 17, 2020Updated 5 years ago
- ☆34Mar 24, 2023Updated 3 years ago
- Attributed graph datasets with ground truth clusters☆12Aug 9, 2022Updated 3 years ago
- USTC研究生学术报告选课脚本☆18Dec 6, 2022Updated 3 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
- ☆14Nov 26, 2022Updated 3 years ago
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- A graph matching library for Python☆210Apr 25, 2024Updated 2 years ago
- ☆22Apr 15, 2026Updated 3 weeks ago
- Stanford Network Analysis Platform (SNAP) is a general purpose network analysis and graph mining library.☆2,272Dec 10, 2023Updated 2 years ago
- Content classification/clustering through language processing☆25Mar 10, 2012Updated 14 years ago
- Code and data for the CIKM2021 paper "Learning Ideological Embeddings From Information Cascades"☆10Sep 8, 2021Updated 4 years ago
- Foofah: programming-by-example data transformation program synthesizer☆28Apr 23, 2018Updated 8 years ago
- Graph Mining Using SPARQL☆21Aug 6, 2015Updated 10 years ago