xgfs/verse
Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures
This tool helps you analyze complex network data, like social networks, biological interactions, or citation graphs, by converting them into a format that machine learning models can easily understand. You input your existing graph data, such as a list of connections or an adjacency matrix, and it outputs a set of numerical representations (embeddings) for each item in your network. Data scientists, researchers, and network analysts can use these embeddings for tasks like predicting missing links, classifying nodes, or recommending items.
134 stars. No commits in the last 6 months.
Use this if you need to transform your graph or network data into a numerical vector format to apply machine learning techniques for tasks like classification or similarity analysis.
Not ideal if you are looking for a visual graph exploration tool or need to perform real-time, high-frequency updates to your graph embeddings.
Stars
134
Forks
22
Language
C++
License
MIT
Category
Last pushed
Feb 21, 2021
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/embeddings/xgfs/verse"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Higher-rated alternatives
eliorc/node2vec
Implementation of the node2vec algorithm.
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...