top- $k$问题的合作对策论解概念
Cooperative Game Theoretic Solution Concepts for top-$k$ Problems
摘要:
发现$k$最关键节点的问题,被称为$top\text{-}k$问题,在诸如社交网络中的信息扩散和偏好聚集、数据点聚类等的若干背景下是非常重要的问题。在文献中已经观察到,大多数流行的合作博弈论解决方案概念分配给节点的值,作为该节点(或数据点)本身被包括在$top\text{-}k$集合中的适当性的良好度量。然而,通常,具有最高$k$值的节点不是期望的$top\text{-}k$节点,因为节点作为$top\text{-}k$集合的一部分的适当性取决于集合中的其它节点。由于这没有被合作博弈论解决方案概念明确地捕获,因此有必要对所获得的值进行后处理,以便输出合适的$top\text{-}k$节点。在本文中,我们提出了几个这样的后处理方法,并给出每个背后的推理,还提出了一个独立的算法,结合合作博弈论的解决方案的概念与流行的贪婪爬山算法。
英文摘要:
The problem of finding the $k$ most critical nodes, referred to as the $top\text{-}k$ problem, is a very important one in several contexts such as information diffusion and preference aggregation in social networks, clustering of data points, etc. It has been observed in the literature that the value allotted to a node by most of the popular cooperative game theoretic solution concepts, acts as a good measure of appropriateness of that node (or a data point) to be included in the $top\text{-}k$ set, by itself. However, in general, nodes having the highest $k$ values are not the desirable $top\text{-}k$ nodes, because the appropriateness of a node to be a part of the $top\text{-}k$ set depends on other nodes in the set. As this is not explicitly captured by cooperative game theoretic solution concepts, it is necessary to post-process the obtained values in order to output the suitable $top\text{-}k$ nodes. In this paper, we propose several such post-processing methods and give reasoning behind each of them, and also propose a standalone algorithm that combines cooperative game theoretic solution concepts with the popular greedy hill-climbing algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。