graph embeddings

[cassinius]

• 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!)