ChristalC / Frequent-Subgraph-MiningLinks
Frequent subgraph mining using FFSM algorithm, C++
☆11Updated 8 years ago
Alternatives and similar repositories for Frequent-Subgraph-Mining
Users that are interested in Frequent-Subgraph-Mining are comparing it to the libraries listed below
Sorting:
- Python implementation of closed frequent subgraph mining algorithm cgSpan. Only undirected graphs are currently supported.☆13Updated 4 years ago
- Reimplementation of Graph Autoencoder by Kipf & Welling with DGL.☆63Updated 2 years ago
- Subgraph matching and isomorphisms in Python.☆28Updated 3 years ago
- An easily extensible C++ library for (suboptimally) computing the graph edit distance between attributed graphs.☆64Updated 2 years ago
- Data for "Understanding Isomorphism Bias in Graph Data Sets" paper.☆91Updated 6 years ago
- Distributed Graph Mining on a Massive "Single" Graph☆16Updated 5 years ago
- GraphZoom: A Multi-level Spectral Approach for Accurate and Scalable Graph Embedding (ICLR'20 Oral)☆114Updated 2 years ago
- ☆98Updated 2 years ago
- A package for computing Graph Kernels☆102Updated 2 years ago
- A python package for graph kernels, graph edit distances, and graph pre-image problem.☆128Updated 7 months ago
- "Do We Need Anisotropic Graph Neural Networks?" at ICLR 2022☆33Updated 3 years ago
- Graph partitioning for distributed GNN training☆14Updated 2 years ago
- GraMi is a novel framework for frequent subgraph mining in a single large graph, GraMi outperforms existing techniques by 2 orders of ma…☆119Updated 2 years ago
- The SEMB library is an easy-to-use tool for getting and evaluating structural node embeddings in graphs.☆18Updated 2 years ago
- Core Decomposition in Multilayer Networks: Theory, Algorithms, and Applications☆12Updated 7 years ago
- Implementation of Directional Graph Networks in PyTorch and DGL☆118Updated 4 years ago
- TIP: Tri-graph Interaction Propagation model for Polypharmacy Side Effect Prediction (GRL@NeurIPS, 2019)☆25Updated 3 years ago
- ☆65Updated 6 years ago
- VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs☆136Updated 4 months ago
- 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
- [NeurIPS 2023] Implementation of "Transformers over Directed Acyclic Graphs"☆76Updated 8 months ago
- Dir-GNN is a machine learning model that enables learning on directed graphs.☆82Updated 2 years ago
- The code of Graph Attention Networks for Cora, Citeseer, Pubmed and PPI☆35Updated 6 years ago
- gBolt--very fast implementation for gSpan algorithm in data mining☆60Updated 4 years ago
- Multilevel graph coarsening algorithm with spectral and cut guarantees☆91Updated 5 years ago
- ☆366Updated last year
- Parallel Frequent Subgraph Mining☆30Updated 8 years ago
- Geo2DR: A Python and PyTorch library for learning distributed representations of graphs.☆46Updated 2 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆164Updated 2 years ago
- This repository contains research into the use of graph partitioning algorithms for assigning people shelters based on their social netwo…☆18Updated 6 years ago