arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2009.07227cs.SIcs.HC
收藏

使用可视化分析审计基于图的排名的敏感性

Auditing the Sensitivity of Graph-based Ranking with Visual Analytics

Tiankai Xie, Yuxin Ma, Hanghang Tong, My T. Thai, Ross Maciejewski

摘要:

图挖掘在许多学科中发挥着关键作用,并且已经开发了各种算法来回答谁/什么类型的问题。例如,在电子商务平台上,我们应该向给定的用户推荐哪些商品?这些问题的答案通常以排序列表的形式返回,并且基于图的排序方法广泛用于工业信息检索设置中。然而,这些排名算法具有各种敏感性,即使是排名的微小变化也可能导致产品销售和页面点击量的大幅减少。因此,需要能够帮助模型开发人员和分析人员探索图排名算法相对于图结构内的扰动的敏感性的工具和方法。在本文中,我们提出了一个可视化的分析框架,通过执行基于扰动的假设分析来解释和探索任何基于图的排名算法的敏感性。我们证明了我们的框架,通过三个案例研究,检查两个经典的基于图形的排名算法(PageRank和HITS)的敏感性,适用于政治新闻媒体和社交网络的排名。

英文摘要:

Graph mining plays a pivotal role across a number of disciplines, and a variety of algorithms have been developed to answer who/what type questions. For example, what items shall we recommend to a given user on an e-commerce platform? The answers to such questions are typically returned in the form of a ranked list, and graph-based ranking methods are widely used in industrial information retrieval settings. However, these ranking algorithms have a variety of sensitivities, and even small changes in rank can lead to vast reductions in product sales and page hits. As such, there is a need for tools and methods that can help model developers and analysts explore the sensitivities of graph ranking algorithms with respect to perturbations within the graph structure. In this paper, we present a visual analytics framework for explaining and exploring the sensitivity of any graph-based ranking algorithm by performing perturbation-based what-if analysis. We demonstrate our framework through three case studies inspecting the sensitivity of two classic graph-based ranking algorithms (PageRank and HITS) as applied to rankings in political news media and social networks.

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

↑