GemsLab/RGM
Fast embedding-based graph classification with connections to kernels
This tool helps researchers analyze and categorize different types of networks or graphs, such as social networks, chemical structures, or citation graphs. It takes a graph as input and transforms it into a numerical representation that can then be used by standard machine learning models to classify the graph into predefined categories. This is ideal for data scientists or machine learning researchers working with complex graph-structured data.
No commits in the last 6 months.
Use this if you need to classify entire graphs based on their structure and the relationships between their nodes.
Not ideal if your task is to classify individual nodes within a single graph or predict missing links.
Stars
13
Forks
4
Language
Python
License
—
Category
Last pushed
May 06, 2020
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/embeddings/GemsLab/RGM"
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...