Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport
-
Updated
Mar 2, 2021 - Python
Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport
A Capsule Network-based Model for Learning Node Embeddings (CIKM 2020)
Code for "Vertex-reinforced Random Walk for Network Embedding"
Add a description, image, and links to the unsupervised-graph-embedding topic page so that developers can more easily learn about it.
To associate your repository with the unsupervised-graph-embedding topic, visit your repo's landing page and select "manage topics."