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 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.
RepositoryStats indexes 534,880 repositories, of these ehab-abdelhamid/GraMi is ranked #263,794 (51st percentile) for total stargazers, and #236,088 for total watchers. Github reports the primary language for this repository as Java, for repositories using this language it is ranked #15,156/26,728.
ehab-abdelhamid/GraMi has 3 open pull requests on Github, 3 pull requests have been merged over the lifetime of the repository.
Github issues are enabled, there are 7 open issues and 10 closed issues.
There have been 1 release, the latest one was published on 2014-04-01 (10 years ago) with the name GraMi v0.1.
Star History
Github stargazers over time
Watcher History
Github watchers over time, collection started in '23
Recent Commit History
0 commits on the default branch (master) since jan '22
No recent commits to this repository
Yearly Commits
Commits to the default branch (master) per year
Issue History
Languages
The only known language in this repository is Java
updated: 2024-06-19 @ 10:24am, id: 17661698 / R_kgDOAQ1_Ag