frequent-subgraph-mining
There are 2 repositories under frequent-subgraph-mining topic.
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.
Language:Java 104- Language:C# 17
NikhilGupta1997 / Data-Mining-Algorithms
A generic library created to perform unsupervised clustering and frequent subgraph mining
Language:C++ 8Aditi-Singla / Data-Mining
Data Mining course projects
Language:C++ 6vaibhavbhagee / Data-Mining
Data Mining course projects
Language:C++ 5navreeetkaur / graph-classification
Frequent Subgraph Mining and Graph Classification
Language:C++ 2loopyme / mindspore_subgraph_detection
Detect sub-graphs in a Mindspore computational graph
Language:Python 1zakimjz / GPU_graph_mining
GPU graph mining
Language:C++ 1ChinmayMittal / COL761-Data-Mining
Data Mining Course Repository, 7th Semester 2023-24, IITD
Language:Python 0
