27 skills found
betterenvi / GSpanPython implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.
ehab-abdelhamid / GraMiGraMi is a novel framework for frequent subgraph mining in a single large graph, GraMi outperforms existing techniques by 2 orders of magnitudes. GraMi supports finding frequent subgraphs as well as frequent patterns, Compared to subgraphs, patterns offer a more powerful version of matching that captures transitive interactions between graph nodes (like friend of a friend) which are very common in modern applications. Also, GraMi supports user-defined structural and semantic constraints over the results, as well as approximate results. For more details, check our paper: Mohammed Elseidy, Ehab Abdelhamid, Spiros Skiadopoulos, and Panos Kalnis. GRAMI: Frequent Subgraph and Pattern Mining in a Single Large Graph. PVLDB, 7(7):517-528, 2014.
THUNLP-MT / PS VAEThis repo contains the codes for our paper: Molecule Generation by Principal Subgraph Mining and Assembling.
ehab-abdelhamid / ScaleMineParallel Frequent Subgraph Mining
ColinConduff / FrequentSubgraphMiningThis is a python implementation of the Gaston frequent subgraph mining algorithm.
fuvty / DeSCo[WSDM'24 Oral] The official implementation of paper <DeSCo: Towards Generalizable and Scalable Deep Subgraph Counting>
nphdang / GSpangSpan, an efficient algorithm for mining frequent subgraphs
BorgwardtLab / MotiFiestaApproximate subgraph motif mining through learnable edge contraction.
zakimjz / DistGraphDistributed Graph Mining on a Massive "Single" Graph
shangjingbo1226 / ContrastSubgraphMiningContrast Subgraph Mining from Coherent Cores
NaazS03 / CgSpanPython implementation of closed frequent subgraph mining algorithm cgSpan. Only undirected graphs are currently supported.
GuillaumeDD / GowpyA very simple library for exploiting graph-of-words in NLP
ChristalC / Frequent Subgraph MiningFrequent subgraph mining using FFSM algorithm, C++
RingBDStack / AdaSNNCode for "Adaptive Subgraph Neural Network with Reinforced Critical Structure Mining"
NikhilGupta1997 / Data Mining AlgorithmsA generic library created to perform unsupervised clustering and frequent subgraph mining
IBM / Anonymized ETL Flow Datasets For FSMAnonymized version of six datasets taken from IBM's DataStage™ production systems and can be used for frequent subgraph mining
kalininalab / RinminerRINminer is a frequent subgraph mining tool based on the gSpan algorithm with additional features and optimizations for residue interaction networks (RINs).
BorgwardtLab / Significant Subgraph MiningFinding statistically significant subgraphs while correcting for multiple testing
huyquangvevo / FrequentGraphSPIN: Mining Maximal Frequent Subgraphs from Graph Databases
instabaines / Subminesubmine is a research‑grade Python library for frequent subgraph mining that provides a unified, safe, and extensible interface over heterogeneous mining algorithms implemented in Python, C++, and Java.
