search

xgfs / deepwalk-c

DeepWalk implementation in C++
MIT License
99 stars 16 forks source link

Is this lib useful on directed graph? #15

Open cwjmusic opened 3 years ago

cwjmusic commented 3 years ago

Hi, Thanks for your share.Have you ever try experiment on directed graph,I found that this worked good on undirected graph but have some porblem with directed graph.

xgfs commented 3 years ago

Do you have an example graph to verify? Also, what other library you were using?

cwjmusic commented 3 years ago

sorry,I dont have an small example protject. I have a directed dataset graph with 10261 nodes and 65557edges, and some query graph with around 5~12node. the query graph is isomorphism with the subgraph in the dataset.so if I use the embedding vector to calculate the Euclidean distance ,the distance between the query nods and the isomorphism subgraph node maybe closer. but I find that if I use the --directed parameter to convert the edgelsit to bcsr,the embedding result is not good,but with the --undirected parameter,the result is better,with means the nodes distance is closer.
So ,I want to know is this project have ever been used for directed graph,thank you!

xgfs commented 3 years ago

The directedness was tested on the node classification dataset. If you do not have a concrete example and the same method working for some other DeepWalk implementation, I am afraid I can not help you further.

cwjmusic commented 3 years ago

Thank you for reply ,I will try to tested further ,if there is any progress, I'll show here ,than you again