The Data Mining Forum                             open-source data mining software open-source data mining software data science journal data mining conferences
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!.  
Is TKG able to handle directed graph? If so, how?
Posted by: Sam
Date: January 15, 2020 12:52AM

Hello,
First of all, thanks a lot for your algorithms. They're very nice.
I have a question, Is the subgraph mining algorithm - TKG able to handle directed graph (it means edges have directions between vertices)? If it is, what is the text format representing in contextTKG.txt?

Thank you.

Options: ReplyQuote
Re: Is TKG able to handle directed graph? If so, how?
Date: January 15, 2020 05:38AM

Hi,

Thanks for your interest in the software! TKG currently only handles undirected graph.

But I know that it could be modified for handling directed graphs. It is just that we did not do it. To modify it for directed graphs, since TKG is based on gSpan, one could just follow the instructions about how to modify gSpan for directed graphs, which have been described in p.9 of this paper:
http://hanj.cs.illinois.edu/pdf/kdd03_closegraph.pdf
It would require some programming and testing to do this. If you decide to do it, please let me know and we could include the new version in SPMF.

Best regards,

Philippe

Options: ReplyQuote


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