personalized pagerank (PPR) has enormous applications, such as link
prediction and recommendation systems for social networks, which often require
the fully PPR to be known. Besides, most of real-life graphs are edge-weighted,
e.g., the interaction between users on the Facebook network
本文介绍了一种新的双向算法来估计随机游走得分,其中结合了更高效的 Monte Carlo 和线性代数方法,使速度提高了 70 倍以上,可以用于社交网络、用户 - 项目网络和网页等网络上的个性化搜索和推荐。此外,文章还提出了其他相关算法,可用于无向图、任意步长和马尔可夫链、个性化搜索排名和从给定源到给定目标集的随机路径抽样。