abojchevski/graph2gauss
Gaussian node embeddings. Implementation of "Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking".
Implements unsupervised inductive node embedding via a ranking-based objective that learns probabilistic Gaussian representations rather than point embeddings, enabling uncertainty quantification. Built in TensorFlow with support for attributed graphs or one-hot/adjacency-based variants when node features are unavailable. The approach leverages graph structure and node attributes through a deep architecture that optimizes pairwise ranking losses to capture both local and global graph properties.
179 stars. No commits in the last 6 months.
Stars
179
Forks
41
Language
Python
License
MIT
Category
Last pushed
May 15, 2023
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/embeddings/abojchevski/graph2gauss"
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.
ferencberes/online-node2vec
Node Embeddings in Dynamic Graphs
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...