arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1505.06386cs.DScs.IR
收藏

BrowseGraph上的局部排序问题

Local Ranking Problem on the BrowseGraph

Michele Trevisiol, Luca Maria Aiello, Paolo Boldi, Roi Blanco

摘要:

“局部排名问题”(LRP)与局部图上的中心性排名的计算有关,其中节点的得分可能与全局图上计算的得分显著不同。以前的工作已经研究了LRP的超链接图,但从来没有在BrowseGraph,即一个图的节点是网页和边缘的浏览转换。近年来,该图在诸如排名、预测和推荐等不同任务中受到越来越多的关注。然而,一个Web服务器只有在其页面上执行的浏览流量(本地BrowseGraph),因此,本地计算可能会导致估计错误,这阻碍了越来越多的应用程序在最先进的状态。此外,虽然本地和全球排名之间的分歧已经测量,估计这种分歧的可能性,只使用本地知识主要被忽视。这些方面是非常感兴趣的在线服务提供商谁想要:(一)衡量他们的能力,正确地评估其资源的重要性,只有基于他们的本地知识,以及(二)考虑到真正的用户浏览流量,更好地捕捉实际用户的兴趣比静态的超链接网络。我们研究LRP问题的BrowseGraph从一个大型的新闻提供商,考虑子图的聚合来自不同领域的用户的浏览轨迹。我们表明,排名之间的距离可以准确预测的基础上,只有局部图的结构信息,能够实现高达0.8的平均排名相关性。

英文摘要:

The "Local Ranking Problem" (LRP) is related to the computation of a centrality-like rank on a local graph, where the scores of the nodes could significantly differ from the ones computed on the global graph. Previous work has studied LRP on the hyperlink graph but never on the BrowseGraph, namely a graph where nodes are webpages and edges are browsing transitions. Recently, this graph has received more and more attention in many different tasks such as ranking, prediction and recommendation. However, a web-server has only the browsing traffic performed on its pages (local BrowseGraph) and, as a consequence, the local computation can lead to estimation errors, which hinders the increasing number of applications in the state of the art. Also, although the divergence between the local and global ranks has been measured, the possibility of estimating such divergence using only local knowledge has been mainly overlooked. These aspects are of great interest for online service providers who want to: (i) gauge their ability to correctly assess the importance of their resources only based on their local knowledge, and (ii) take into account real user browsing fluxes that better capture the actual user interest than the static hyperlink network. We study the LRP problem on a BrowseGraph from a large news provider, considering as subgraphs the aggregations of browsing traces of users coming from different domains. We show that the distance between rankings can be accurately predicted based only on structural information of the local graph, being able to achieve an average rank correlation as high as 0.8.

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

↑