abojchevski/graph2gauss

Gaussian node embeddings. Implementation of "Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking".

47
/ 100
Emerging

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.

Stale 6m No Package No Dependents
Maintenance 0 / 25
Adoption 10 / 25
Maturity 16 / 25
Community 21 / 25

How are scores calculated?

Stars

179

Forks

41

Language

Python

License

MIT

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.