A hub-aware random walk strategy, tuned per dataset by grid search, beats dynnode2vec on graph reconstruction for 8 of 9 temporal networks.
Statistical Analysis and Data Mining: The ASA Data Science Journal 17(2), e11676 (2024)
1 Pith paper cite this work, alongside 3 external citations. Polarity classification is still indexing.
1
Pith paper citing it
3
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.SI 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 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.