eliorc/node2vec
Implementation of the node2vec algorithm.
This tool helps you understand relationships and find similar items within complex network structures like social circles, recommendation systems, or biological pathways. It takes a network of connected items (a graph) and converts each item and its connections into a numerical representation. This allows you to easily discover which items are most alike or which connections are strongest, providing insights to network analysts, data scientists, or researchers.
1,293 stars. No commits in the last 6 months. Available on PyPI.
Use this if you need to find similar nodes or edges within a network and want to represent complex relationships in a numerical format for further analysis or machine learning tasks.
Not ideal if your data is not structured as a network or if you need to perform real-time, ultra-low-latency similarity lookups on extremely large and constantly changing graphs.
Stars
1,293
Forks
254
Language
Python
License
MIT
Category
Last pushed
Oct 06, 2025
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
mims-harvard/decagon
Graph convolutional neural network for multirelational link prediction
mims-harvard/nimfa
Nimfa: Nonnegative matrix factorization in Python
ferencberes/online-node2vec
Node Embeddings in Dynamic Graphs
claws-lab/jodie
A PyTorch implementation of ACM SIGKDD 2019 paper "Predicting Dynamic Embedding Trajectory in...
mims-harvard/Raindrop
Graph Neural Networks for Irregular Time Series