Wire Before You Walk

Tesfa Asmara, Dhananjay Bhaskar, Ian Adelstein, Smita Krishnaswamy, Michael Perlmutter

Abstract

Node embeddings aim to associate a vector to every vertex of a graph which can then be used for downstream tasks such as clustering, classification, or link prediction. Many popular node embeddings such as no $d$ e2vec and DeepWalk are based upon counting which nodes frequently co-occur in random walks of the graph. In this paper, we show that the performance of such algorithms can be improved by rewiring the edges of the graph through a variety of network indices before running DeepWalk. These rewirings effectively give the random walker an inductive bias and increase the accuracy of a logistic regression classifier applied to the node embedding on several benchmark data sets.
BibTeX
@inproceedings{asmara2023wire,
  author = {Tesfa Asmara and Dhananjay Bhaskar and Ian Adelstein and Smita Krishnaswamy and Michael Perlmutter},
  title = {{Wire Before You Walk}},
  booktitle = {ACSSC},
  year = {2023},
  doi = {10.1109/ieeeconf59524.2023.10477089},
}

Loading related content...

Figure