eliorc/node2vec
Implementation of the node2vec algorithm.
Leverages biased random walks parameterized by return probability (p) and in-out parameters (q) to generate node sequences, then applies gensim's Word2Vec for embedding. Supports weighted graphs, node-specific sampling strategies, and memory-efficient processing via temporary folder storage for large networks. Provides multiple edge embedding methods (Hadamard, average, weighted L1/L2) to derive edge representations from node embeddings.
1,293 stars and 43,847 monthly downloads. No commits in the last 6 months. Available on PyPI.
Stars
1,293
Forks
254
Language
Python
License
MIT
Category
Last pushed
Oct 06, 2025
Monthly downloads
43,847
Commits (30d)
0
Dependencies
5
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/embeddings/eliorc/node2vec"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Related tools
ferencberes/online-node2vec
Node Embeddings in Dynamic Graphs
eugeneyan/ml-surveys
📋 Survey papers summarizing advances in deep learning, NLP, CV, graphs, reinforcement learning,...
mims-harvard/nimfa
Nimfa: Nonnegative matrix factorization in Python
mims-harvard/decagon
Graph convolutional neural network for multirelational link prediction
claws-lab/jodie
A PyTorch implementation of ACM SIGKDD 2019 paper "Predicting Dynamic Embedding Trajectory in...