Re: Mining frequent subgraphs in a graph (Java or C#)
Posted by:
Dang Nguyen
Date: December 29, 2017 12:44AM
You can download the source code of gSpan, an efficient algorithm for mining frequent subgraphs in a graph dataset, in C# from this link:
https://dl.dropboxusercontent.com/u/56886384/Data_Mining/ICCSAMA_2015/source_code_gSpan.zip
If you use this source code in your paper or project, please cite our work in this paper:
Bay Vo, Dang Nguyen, Thanh-Long Nguyen (2015). A parallel algorithm for frequent subgraph mining. ICCSAMA 2015, Metz, France. Springer AISC, 358, 163-173.