Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.
☆214Dec 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
Sorting:
- GraMi is a novel framework for frequent subgraph mining in a single large graph, GraMi outperforms existing techniques by 2 orders of ma…☆120Jan 5, 2024Updated 2 years ago
- gSpan, an efficient algorithm for mining frequent subgraphs☆19Jan 4, 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 7 years ago
- The ParSeMiS project (Parallel and Sequential Graph Mining Suite) searches for frequent, interesting substructures in graph databases. ht…☆46Mar 19, 2020Updated 5 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
- Parallel Frequent Subgraph Mining☆30Nov 18, 2017Updated 8 years ago
- Distributed Graph Mining on a Massive "Single" Graph☆15Mar 28, 2020Updated 5 years ago
- Repository for RuDiK, a system for discovering declarative logical rules over RDF Knowledge Bases☆27May 8, 2024Updated last year
- ☆11Jun 21, 2022Updated 3 years ago
- The Subdue graph miner discovers highly-compressing patterns in an input graph.☆41Jun 18, 2024Updated last year
- A scikit-learn compatible library for graph kernels☆637Jul 26, 2025Updated 7 months ago
- Approximate subgraph motif mining through learnable edge contraction.☆15Aug 3, 2023Updated 2 years ago
- Fast graph-regularized matrix factorization☆20Oct 3, 2023Updated 2 years ago
- Local Community Detection in Multiple Netwrks☆16Feb 27, 2025Updated last year
- ☆22Feb 5, 2026Updated last month
- Segmented Code Adjustment Quantization (SAQ)☆17Sep 22, 2025Updated 5 months ago
- Code and data for the CIKM2021 paper "Learning Ideological Embeddings From Information Cascades"☆10Sep 8, 2021Updated 4 years ago
- Benchmark for Graph Embedding Methods☆48Dec 7, 2020Updated 5 years ago
- Repository for "Scaling Evaluation-time Compute with Reasoning Models as Process Evaluators"☆12Mar 25, 2025Updated 11 months ago
- Multi-Graph Multi-Label Learning☆11May 30, 2018Updated 7 years ago
- Attributed graph datasets with ground truth clusters☆12Aug 9, 2022Updated 3 years ago
- A fast MATLAB implementation of the Weisfeiler--Lehman graph transformation and associated kernel.☆11Oct 25, 2017Updated 8 years ago
- ☆14Nov 26, 2022Updated 3 years ago
- ☆25Aug 15, 2020Updated 5 years ago
- The implementation for "Open Relation Modeling: Learning to Define Relations between Entities" (Findings of ACL '22)☆12Feb 28, 2022Updated 4 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Apr 6, 2020Updated 5 years ago
- Code and experiments for the paper "A Partitioning Algorithm for Maximum Common Subgraph Problems"☆15Jun 17, 2020Updated 5 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆86Sep 1, 2024Updated last year
- ☆20Apr 3, 2025Updated 11 months ago
- Implementation fo Zorro: Valid, Sparse, and Stable Explanations in Graph Neural Networks☆16Aug 31, 2022Updated 3 years ago
- Dynamic programming algorithms for exact linear clustering in networks.☆16Jul 4, 2023Updated 2 years ago
- ☆12Jan 29, 2022Updated 4 years ago
- Temporal network visualization☆15Jun 19, 2021Updated 4 years ago
- This paper is accpeted by WSDM 2023☆13Mar 13, 2023Updated 2 years ago
- Library of python functions for the analysis of hypergraphs.☆15Feb 1, 2025Updated last year
- HAKES: Efficient Data Search with Embedding Vectors at Scale☆45Jan 22, 2026Updated last month
- ☆34Mar 24, 2023Updated 2 years ago