New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

graph embeddings #116

Open

6 tasks

cassinius opened this issue Feb 8, 2020 · 0 comments

Collaborator

cassinius commented Feb 8, 2020

implement simple graph embeddings via deep walk / random walks
construct similarity (k-NN) graphs
use similarity graph for
- node classification
- missing attribute prediction (cold-start etc.)
  => use this for the small Guetl workshop paper !!
- link prediction (direct recommendation, baby!)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment