ehab-abdelhamid / GraMi
GraMi 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 …
☆112Updated last year
Alternatives and similar repositories for GraMi
Users that are interested in GraMi are comparing it to the libraries listed below
Sorting:
- Parallel Frequent Subgraph Mining☆31Updated 7 years ago
- Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.☆202Updated 4 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆157Updated last year
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆25Updated 3 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- FORA: Simple and Effective Approximate Single-Source Personalized Pagerank☆31Updated 4 years ago
- VF2 - Subgraph Isomorphism☆45Updated 5 years ago
- The ParSeMiS project (Parallel and Sequential Graph Mining Suite) searches for frequent, interesting substructures in graph databases. ht…☆44Updated 5 years ago
- ☆14Updated 3 years ago
- gBolt--very fast implementation for gSpan algorithm in data mining☆57Updated 3 years ago
- Distributed Graph Mining on a Massive "Single" Graph☆15Updated 5 years ago
- ☆27Updated 2 years ago
- Experimental Setup for Performance Analysis of Streaming Algorithms☆31Updated 3 years ago
- A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs☆27Updated 9 years ago
- A general-purpose, distributed graph random walk engine.☆110Updated last year
- Graph Partitoning Using Graph Convolutional Networks☆65Updated 2 years ago
- Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"☆53Updated 9 months ago
- This is a python implementation of the Gaston frequent subgraph mining algorithm.☆20Updated 5 years ago
- A collection of awesome papers about graph processing.☆15Updated 5 years ago
- Source code and datasets of "An In-Depth Study of Continuous Subgraph Matching", accepted by VLDB'22 - By Xibo Sun, Dr. Shixuan Sun, Prof…☆49Updated 2 years ago
- ☆13Updated 3 years ago
- VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs☆126Updated 2 years ago
- Graph Pattern Mining☆90Updated 7 months ago
- Edge-centric Graph Processing System using Streaming Partitions☆82Updated 7 years ago
- Codes for TopPPR☆13Updated 6 years ago
- Exact graph edit distance (GED) computation and verification☆60Updated 2 years ago
- Trillion-edge Scale Graph Edge Partitioning☆27Updated 5 years ago
- ☆18Updated 3 years ago
- A software package for one-pass Vertex-cut balanced Graph Partitioning.☆30Updated 9 years ago
- gSpan, an efficient algorithm for mining frequent subgraphs☆18Updated 5 years ago