Alternatives and similar repositories for Frequent-Subgraph-Mining

Users that are interested in Frequent-Subgraph-Mining are comparing it to the libraries listed below

• sbarakat / graph-partitioning
  This repository contains research into the use of graph partitioning algorithms for assigning people shelters based on their social netwo…
  ☆18Updated 6 years ago
• jdmoorman / uclasm
  Subgraph matching and isomorphisms in Python.
  ☆28Updated 3 years ago
• egalimberti / multilayer_core_decomposition
  Core Decomposition in Multilayer Networks: Theory, Algorithms, and Applications
  ☆12Updated 7 years ago
• shionhonda / gae-dgl
  Reimplementation of Graph Autoencoder by Kipf & Welling with DGL.
  ☆63Updated 3 years ago
• jajupmochi / graphkit-learn
  A python package for graph kernels, graph edit distances, and graph pre-image problem.
  ☆128Updated 8 months ago
• gbouritsas / PnC
  Official repository for the paper "Partition and Code: learning how to compress graphs" (NeurIPS'21) https://arxiv.org/abs/2107.01952
  ☆36Updated 4 years ago
• NaazS03 / cgSpan
  Python implementation of closed frequent subgraph mining algorithm cgSpan. Only undirected graphs are currently supported.
  ☆13Updated 4 years ago
• kfoynt / LocalGraphClustering
  ☆144Updated 4 years ago
• DongqiFu / DPPIN
  DPPIN: A Biological Repository of Dynamic Protein-Protein Interaction Network Data, IEEE BigData 2022
  ☆32Updated 2 years ago
• BorgwardtLab / GraphKernels
  A package for computing Graph Kernels
  ☆102Updated 2 years ago
• TheGravLab / A-Unifying-Framework-for-Spectrum-Preserving-Graph-Sparsification-and-Coarsening
  Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)
  ☆16Updated 5 years ago
• MiviaLab / vf3lib
  VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs
  ☆137Updated 5 months ago
• Jokeren / gBolt
  gBolt--very fast implementation for gSpan algorithm in data mining
  ☆60Updated 4 years ago
• BorgwardtLab / MotiFiesta
  Approximate subgraph motif mining through learnable edge contraction.
  ☆15Updated 2 years ago
• GraphPKU / I2GNN
  official code for I2GNN.
  ☆13Updated 2 years ago
• nd7141 / graph_datasets
  Data for "Understanding Isomorphism Bias in Graph Data Sets" paper.
  ☆91Updated 6 years ago
• KarypisLab / PM4GNN
  Graph partitioning for distributed GNN training
  ☆14Updated 2 years ago
• zakimjz / DistGraph
  Distributed Graph Mining on a Massive "Single" Graph
  ☆16Updated 5 years ago
• snap-stanford / neural-subgraph-learning-GNN
  ☆366Updated last year
• lorenzopalloni / wl-graph-kernels
  A Python implementation of a fast approximation of the Weisfeiler-Lehman Graph Kernels.
  ☆24Updated 6 years ago
• cornell-zhang / GraphZoom
  GraphZoom: A Multi-level Spectral Approach for Accurate and Scalable Graph Embedding (ICLR'20 Oral)
  ☆114Updated 2 years ago
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆164Updated 2 years ago
• chrsmrrs / tudataset
  ☆98Updated 2 years ago
• mims-harvard / ohmnet
  OhmNet: Representation learning in multi-layer graphs
  ☆84Updated 5 years ago
• shyam196 / egc
  "Do We Need Anisotropic Graph Neural Networks?" at ICLR 2022
  ☆33Updated 3 years ago
• thocevar / orca
  ORbit Counting Algorithm
  ☆44Updated 9 years ago
• GemsLab / StrucEmbedding-GraphLibrary
  The SEMB library is an easy-to-use tool for getting and evaluating structural node embeddings in graphs.
  ☆18Updated 2 years ago
• Saro00 / DGN
  Implementation of Directional Graph Networks in PyTorch and DGL
  ☆118Updated 4 years ago
• emalgorithm / directed-graph-neural-network
  Dir-GNN is a machine learning model that enables learning on directed graphs.
  ☆83Updated 2 years ago
• Erfaan-Rostami / Hypergraph-and-Graph-Neural-Network-HGNN-GNN--
  Many underlying relationships among data in several areas of science and engineering, e.g., computer vision, molecular chemistry, molecul…
  ☆57Updated 2 years ago