arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.11876cs.DS
收藏

将PageRank个性化为目标节点,再访

Personalized PageRank to a Target Node, Revisited

Hanzhi Wang, Zhewei Wei, Junhao Gan, Sibo Wang, Zengfeng Huang

摘要:

个性化PageRank(PPR)是图挖掘和网络分析中广泛使用的节点邻近度度量。给定源节点$s$和目标节点$t$,PPR值$π(s,t)$表示从$s$开始的随机游走在$t$处终止的概率,并且因此指示$s$和$t$之间的双向重要性。现有的大多数工作集中在单源查询上,该查询要求给定源节点$s$和每个节点$t \in V$的PPR值。然而,单源查询仅反映每个节点$t$相对于$s$的重要性。在本文中,我们考虑{ \em单目标PPR查询},它测量PPR的相反方向的重要性。给定目标节点$t$,单目标PPR查询要求每个节点$s\in V$到给定目标节点$t$的PPR值。我们提出了RBS,一种新的算法,回答近似单目标查询具有最佳的计算复杂性。我们表明,RBS改进了三个具体的应用程序:重量级PPR查询,单源SimRank计算,可扩展的图神经网络。我们进行实验,以证明RBS优于国家的最先进的算法在效率和精度方面的真实世界的基准数据集。

英文摘要:

Personalized PageRank (PPR) is a widely used node proximity measure in graph mining and network analysis. Given a source node $s$ and a target node $t$, the PPR value $π(s,t)$ represents the probability that a random walk from $s$ terminates at $t$, and thus indicates the bidirectional importance between $s$ and $t$. The majority of the existing work focuses on the single-source queries, which asks for the PPR value of a given source node $s$ and every node $t \in V$. However, the single-source query only reflects the importance of each node $t$ with respect to $s$. In this paper, we consider the {\em single-target PPR query}, which measures the opposite direction of importance for PPR. Given a target node $t$, the single-target PPR query asks for the PPR value of every node $s\in V$ to a given target node $t$. We propose RBS, a novel algorithm that answers approximate single-target queries with optimal computational complexity. We show that RBS improves three concrete applications: heavy hitters PPR query, single-source SimRank computation, and scalable graph neural networks. We conduct experiments to demonstrate that RBS outperforms the state-of-the-art algorithms in terms of both efficiency and precision on real-world benchmark datasets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑