基于增量索引更新的演化图个性化PageRank
Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme
摘要:
{ \em Personalized PageRank(PPR)}是图挖掘中的基本邻近度量。由于计算一个确切的SSPPR查询答案是禁止的,大多数现有的解决方案转向近似查询的保证。近似SSPPR查询的最新解决方案是基于索引的,主要集中在静态图上,而真实世界的图通常是动态变化的。然而,现有的索引更新方案不能实现次线性的更新时间。出于这一动机,我们提出了一个有效的索引方案,以保持索引的随机游走在预期的$O(1)$时间后,每次图形更新。为了减少空间消耗,我们进一步提出了一种新的采样方案,以消除辅助数据结构的顶点,同时仍然支持$O(1)$索引更新成本的发展图。大量的实验表明,我们的更新方案实现了数量级的更新速度比现有的基于索引的动态计划,而不牺牲查询效率。
英文摘要:
{\em Personalized PageRank (PPR)} stands as a fundamental proximity measure in graph mining. Since computing an exact SSPPR query answer is prohibitive, most existing solutions turn to approximate queries with guarantees. The state-of-the-art solutions for approximate SSPPR queries are index-based and mainly focus on static graphs, while real-world graphs are usually dynamically changing. However, existing index-update schemes can not achieve a sub-linear update time. Motivated by this, we present an efficient indexing scheme to maintain indexed random walks in expected $O(1)$ time after each graph update. To reduce the space consumption, we further propose a new sampling scheme to remove the auxiliary data structure for vertices while still supporting $O(1)$ index update cost on evolving graphs. Extensive experiments show that our update scheme achieves orders of magnitude speed-up on update performance over existing index-based dynamic schemes without sacrificing the query efficiency.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。