The Data Mining Forum                             open-source data mining software data science journal data mining conferences high utility mining workshop
This forum is about data mining, data science and big data: algorithms, source code, datasets, implementations, optimizations, etc. You are welcome to post call for papers, data mining job ads, link to source code of data mining algorithms or anything else related to data mining. The forum is hosted by P. Fournier-Viger. No registration is required to use this forum!.  
Release source code of Parallel gSpan for frequent subgraph mining
Posted by: Dang Nguyen
Date: April 07, 2019 03:02PM

Hi All,

I have released the source code of gSpan with parallel computing. This work was published in SDM 2018 and ICCSAMA 2015.

https://github.com/nphdang/gSpan/tree/master/parallel_gSpan

Given a set of graphs (or a graph dataset), the algorithm will find a set of subgraphs whose frequencies are not less than a threshold. Using frequent subgraphs is very useful in many data mining and machine learning tasks such as pattern discovery, classification, and clustering. It also has a variety of real-world applications in different domains, e.g., bio-informatics, chemo-informatics, social networks, action recognition, and so on.

If you have any trouble when running the code, please feel free to let me know.

Cheers,
Dang Nguyen

Options: ReplyQuote


This forum is powered by Phorum and provided by P. Fournier-Viger (© 2012).
Terms of use.