A modified random walk with acceptance probabilities yields node rankings close to DeepWalk's, computed up to 34 times faster via a matrix power series.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Frustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs
A modified random walk with acceptance probabilities yields node rankings close to DeepWalk's, computed up to 34 times faster via a matrix power series.