ehab-abdelhamid / GraMiLinks
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 …
☆114Updated last year
Alternatives and similar repositories for GraMi
Users that are interested in GraMi are comparing it to the libraries listed below
Sorting:
- Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.☆204Updated 4 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆157Updated last year
- Parallel Frequent Subgraph Mining☆31Updated 7 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
- A general-purpose, distributed graph random walk engine.☆110Updated last year
- gBolt--very fast implementation for gSpan algorithm in data mining☆58Updated 4 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆26Updated 3 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 6 years ago
- ☆27Updated 2 years ago
- VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs☆130Updated last week
- A software package for one-pass Vertex-cut balanced Graph Partitioning.☆31Updated 9 years ago
- Experimental Setup for Performance Analysis of Streaming Algorithms☆31Updated 3 years ago
- Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"☆54Updated 11 months ago
- Out-of-core graph processing on a single machine.☆130Updated 7 years ago
- ☆16Updated 4 years ago
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆162Updated 4 years ago
- Distributed Graph Mining on a Massive "Single" Graph☆16Updated 5 years ago
- Codes for TopPPR☆14Updated 6 years ago
- ☆14Updated 3 years ago
- The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"☆25Updated 7 years ago
- A collection of awesome papers about graph processing.☆15Updated 5 years ago
- A fork of Sebastian Nowozin's and Koji Tsuda's gboost code☆17Updated 12 years ago
- ☆143Updated 4 years ago
- Graph Partitoning Using Graph Convolutional Networks☆65Updated 3 years ago
- The ParSeMiS project (Parallel and Sequential Graph Mining Suite) searches for frequent, interesting substructures in graph databases. ht…☆44Updated 5 years ago
- ☆18Updated 3 years ago
- Algorithms to list k-cliques in real-world graphs☆26Updated 4 years ago
- ☆24Updated 3 years ago
- Trillion-edge Scale Graph Edge Partitioning☆27Updated 5 years ago