node2vec
node2vec copied to clipboard
aditya-grover
After fit the Graph to generate node embedding, I achieve this status, and wait for so long, nothing happened then. The code is still running Computing transition probabilities: 100%|████████████████████████████████████████████████████████████████████| 554789/554789...
I have changed the print statements to the new syntax. Getting other errors though. Is there a Python3 version of this software? ``` Traceback (most recent call last): File "C:\Python36\lib\site-packages\networkx\readwrite\edgelist.py",...
!python node2vec/src/main.py --input diseasome.edgelist --output diseasome.emb --dimensions 32 --num-walks 20 --iter 10 Traceback (most recent call last): File "node2vec/src/main.py", line 15, in import node2vec File "/content/node2vec/src/node2vec.py", line 46 print 'Walk...
As explained confirmation from all node2vec papers, this algorithm is designed for 1 graph. It create specific embedding for each graph, so it is not possible for training node2vec model...
Bumps [numpy](https://github.com/numpy/numpy) from 1.11.2 to 1.22.0. Release notes Sourced from numpy's releases. v1.22.0 NumPy 1.22.0 Release Notes NumPy 1.22.0 is a big release featuring the work of 153 contributors spread...
![dependabot[bot] avatar](https://avatars.githubusercontent.com/in/29110?v=4 "dependabot[bot] avatar"){kind=avatar}
Can we use any technique other than word2vec like Glove ,TF-IDF, Fast-Text etc. in the implementation of node2vec for finding embeddings.
The following code almost takes all of the memory. `node2vec = Node2Vec(G_fb, dimensions=emb_size, walk_length=80, num_walks=10, workers=4)` I have 12gb Memory and the nodes are 1.6 million which takes all of...
Hi there, I have a little confusion about your paper. In section 4.1, `Case Study: Les Misérables network`, you show us a homophily result with q1. But in previous section,...
