Monte Carlo Based Personalized PageRank on Dynamic Networks
In large-scale networks, the structure of the underlying network changes frequently, and thus the power iteration method for Personalized PageRank computation cannot deal with this kind of dynamic network efficiently. In this paper, we design a Monte Carlo-based incremental method for Personalized P...
Saved in:
Main Authors: | Zhang Junchao, Chen Junjie, Jiancheng Song, Rong-Xiang Zhao |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2013-09-01
|
Series: | International Journal of Distributed Sensor Networks |
Online Access: | https://doi.org/10.1155/2013/829804 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An Adaptive Reordered Method for Computing PageRank
by: Yi-Ming Bu, et al.
Published: (2013-01-01) -
Application of Modified PageRank Algorithm for Anomaly Detection in Movements of Older Adults
by: Shahram Payandeh, et al.
Published: (2019-01-01) -
Importance Analysis of Causative Nodes for Accident Chains of Railway Locomotive Operation Based on STPA-PageRank Method
by: Ping WAN, et al.
Published: (2025-02-01) -
Double Sampling with Ranked Set Selection in the Second Phase with Nonresponse: Analytical Results and Monte Carlo Experiences
by: Gaajendra K. Agarwal, et al.
Published: (2012-01-01) -
Status of Serpent Monte Carlo code in 2024
by: Leppänen Jaakko, et al.
Published: (2025-01-01)