A hub-aware random walk strategy, tuned per dataset by grid search, beats dynnode2vec on graph reconstruction for 8 of 9 temporal networks.
Physics Reports 519(3), 97–125 (2012) 14 A
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SI 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Dynamic Graph Embedding Through Hub-aware Random Walks
A hub-aware random walk strategy, tuned per dataset by grid search, beats dynnode2vec on graph reconstruction for 8 of 9 temporal networks.