Deepwalk on Weighted Graph about deepwalk

[shun1024]

Hi,

Just for note.

I implemented one weighted version and stored it in:

https://github.com/shun1024/weighted-deepwalk

[GTmac]

@shun1024 Thanks for the implementation! For weighted graphs, you can generalize the random walk function here:
https://github.com/phanein/deepwalk/blob/master/deepwalk/graph.py#L128-L151

Also, introducing alias sampling reduces the time complexity of generating the next node from $O(n)$ to $O(1)$. An implementation of alias sampling can be found here:
https://github.com/aditya-grover/node2vec/blob/master/src/node2vec.py

[shun1024]

@GTmac thanks for suggestion :)

That's pretty great software

[anvarisoraya]

Hello
I just want to know how deepwalk without weight can find word frequency. I dont get that
i appreciate if any one help

[GTmac]

@anvarisoraya I am not sure if I understand your question, but word frequency is computed by counting the number of occurrences of each word (node) in random walks, which does not assume the input graph to be weighted.