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 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.
Alternatives To Grami
Project NameStarsDownloadsRepos Using ThisPackages Using ThisMost Recent CommitTotal ReleasesLatest ReleaseOpen IssuesLicenseLanguage
Cuckoo803
5 months ago3otherC++
a memory-bound graph-theoretic proof-of-work system
Peregrine190
7 months agogpl-3.0C++
Peregrine: A Pattern-Aware Graph Mining System
Socialite99
8 years ago4otherJava
SociaLite: query language for large-scale graph analysis and data mining
Dachshund78
4 months ago11November 16, 20231mitRust
Dachshund is a graph mining library written in Rust. It provides high performance data structures for multiple kinds of graphs, from simple undirected graphs to typed hypergraphs. Dachshund also provides algorithms for common tasks for graph mining and analysis, ranging from shortest paths to graph spectral analysis.
Gspan7814 years ago4July 12, 20204mitJupyter Notebook
Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.
Nous63
4 years ago9Scala
NOUS: Construction, Querying and Reasoning with Knowledge Graphs
Fraudar59
5 months ago11August 30, 20231gpl-3.0Python
A wrapper of FRAUDAR algorithm
Grami54
6 years ago5otherJava
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 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.
Spartan250
2 years ago10December 20, 20211bsd-3-clausePython
A collection of data mining algorithms on big graphs and time series
Arabesque50
5 years ago7apache-2.0Java
Scalable Graph Mining
Alternatives To Grami
Select To Compare


Alternative Project Comparisons
Popular Graph Projects
Popular Mining Projects
Popular Computer Science Categories
Related Searches

Get A Weekly Email With Trending Projects For These Categories
No Spam. Unsubscribe easily at any time.
Java
Graph
Mining