Skip to content

Latest commit

 

History

History
12 lines (11 loc) · 794 Bytes

README.md

File metadata and controls

12 lines (11 loc) · 794 Bytes

Shortest_Distance

Shortest Path Distance Approximation Using Deep Learning Techniques
IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) (2018)

Paper

Shortest Distance Approximation

Data

Facebook

How to run

  1. Learn embeddings using Deepwalk, node2vec or HARP
  2. Generate train and test pairs of nodes by generate_train_test.py
  3. Run feedforward.py or siamese.py to predict the shortest path between nodes