PureRank computes a unique importance score vector for directed networks without user parameters by SCC-based node classification into recurrent/transient/dangling classes and RDI-guided parameter choice in the Katz equation per class.
Choose the damping, choose the ranking? Journal of Discrete Algorithms, 8(2):199–213
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SI 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
PureRank: A parameter-free recursive importance measure for network nodes
PureRank computes a unique importance score vector for directed networks without user parameters by SCC-based node classification into recurrent/transient/dangling classes and RDI-guided parameter choice in the Katz equation per class.