基于Web聚类的分布式高效PageRank计算
Efficient PageRank Computation via Distributed Algorithms with Web Clustering
摘要:
PageRank是搜索引擎中使用的一个著名的中心性度量,代表每个网页的重要性。在本文中,我们遵循最近的分布式算法的PageRank的计算,其中每个页面计算自己的PageRank值通过与超链接连接的页面进行交互的发展研究。我们的方法是新颖的,因为它是基于重新解释的PageRank,这使我们的一组算法的指数收敛速度。我们首先在更新迭代中对页面选择采用流言类型的随机化。然后,算法被推广到确定性的,允许多个页面同时更新。最后,在这些算法的基础上,我们提出了一个基于聚类的方案,在该方案中,页面组之间进行本地交互更新多次,以加快收敛。与其他现有的技术相比,显着的优势,可以表现在他们的收敛性能,通过使用真实的Web数据的数值例子证明,也在有限的页面之间所需的通信量。
英文摘要:
PageRank is a well-known centrality measure for the web used in search engines, representing the importance of each web page. In this paper, we follow the line of recent research on the development of distributed algorithms for computation of PageRank, where each page computes its own PageRank value by interacting with pages connected over hyperlinks. Our approach is novel in that it is based on a reinterpretation of PageRank, which leads us to a set of algorithms with exponential convergence rates. We first employ gossip-type randomization for the page selections in the update iterations. Then, the algorithms are generalized to deterministic ones, allowing simultaneous updates by multiple pages. Finally, based on these algorithms, we propose a clustering-based scheme, in which groups of pages make updates by locally interacting among themselves many times to expedite the convergence. In comparison with other existing techniques, significant advantages can be exhibited in their convergence performance, as demonstrated via numerical examples using real web data, and also in the limited amount of communication required among pages.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。