The Data Mining Forum 
IMPORTANT: This is the old Data Mining forum.
I keep it online so that you can read the old messages.
Please post your new messages in the new forum: https://forum2.philippe-fournier-viger.com/index.php
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
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