directed graph support

[acezen]

Can this gspan algorithm suport directed graph? if it can, what's diff between this and Yan's paper in subgraph growth( get potential children)?

[Jokeren]

Hi, @acezen,

There is an another python project (https://github.com/betterenvi/gSpan) states that it could support directed graph mining, but the correctness is not sure. Indeed, the author has not presented a single line of proof or even the comparison of experimental results. Notice that the repository is written in Python, so I have not compared gBolt with it since it is unfair.

Anyway, I remember my lecturer, who is an expert in graph mining, told us gSpan could be extended to directed graphs.

If you have found any tips to support directed graphs, please tell me and I will be glad to try.

[acezen]

Here Jokeren, here are somthing I found in web:

1. https://books.google.com/books?id=AfL0t-YzOrEC&pg=PA547&dq=gspan+directed&hl=en&sa=X&ved=0ahUKEwjjpP3XkZ_UAhUIs1QKHfljAgsQ6AEIKDAA#v=onepage&q=gspan%20directed&f=false in Han's book 《Data Mining》，he give some idea about extend gspan to directed, not quite much。
2. http://www.mysmu.edu/staff/caneleung/pub/notes-gSpanDirected.pdf this is a paper discuss gspan extended to directed graph, seems well.

Hope these can help you.

[Jokeren]

Thank you, it seems that they are helpful! I will have a look.