Skip to Content

An opinionated guide to graph embeddings

Posted on One min read
Diverse graph world
How can we analyze diverse world of graphs without developing task-specific algorithms?

slides pptx or pdf

TL;DR:

A review of 10 most important algorithms for node embeddings.

I review 10 algorithms for node embeddings. Here I provide a full list with some extra pointers.

  1. DeepWalk paper · authors’ code (Python) · C++ code (mine)
  2. LINE paper · authors’ code (C++)
  3. node2vec paper · authors’ code (Python) · C++ code (mine)
  4. VERSE paper · authors’ code (C++)
  5. HOPE paper · authors’ code (MATLAB)
  6. AROPE paper · authors’ code (MATLAB + Python)
  7. NetMF paper · authors’ code (Python)
  8. RandNE paper · authors’ code (Python)
  9. FastRP paper · authors’ code (Python)
  10. NodeSketch paper · authors’ code (C++ & Python)