不完备网络中自适应探测的最优策略
Towards Optimal Strategy for Adaptive Probing in Incomplete Networks
摘要:
我们研究了一个图探测问题,其中代理只有一个不完整的网络视图$G' \subsetneq G$,并希望探索网络以最少的努力。在每个步骤中,代理选择$G'$中的节点$u$进行探测。在探测$u$之后,代理获得关于$u$及其邻居的信息。$u$的所有邻居都将变为\emph{observed},并且在后续步骤中变为\emph{probable}(如果它们尚未被探测)。要最大化在$k$探测中探测的节点数量,最佳探测策略是什么?这个问题是不完全网络中其他决策问题的基本组成部分,例如社交网络中的信息收集,网络爬行,网络安全和不完全信息的病毒式营销。虽然有几种方法可以解决这个问题,但没有一种方法可以在不同的网络类型中始终如一地表现良好。本文建立了问题的强(不)逼近性,证明了除非P=NP,否则任何算法都不能保证有限逼近比。从好的方面来说,我们设计了学习框架来捕捉单个网络的最佳探测策略。我们广泛的实验表明,我们的框架可以学习有效的探测策略,\emph{consistently}优于以前的算法和基于度量的方法。
英文摘要:
We investigate a graph probing problem in which an agent has only an incomplete view $G' \subsetneq G$ of the network and wishes to explore the network with least effort. In each step, the agent selects a node $u$ in $G'$ to probe. After probing $u$, the agent gains the information about $u$ and its neighbors. All the neighbors of $u$ become \emph{observed} and are \emph{probable} in the subsequent steps (if they have not been probed). What is the best probing strategy to maximize the number of nodes explored in $k$ probes? This problem serves as a fundamental component for other decision-making problems in incomplete networks such as information harvesting in social networks, network crawling, network security, and viral marketing with incomplete information. While there are a few methods proposed for the problem, none can perform consistently well across different network types. In this paper, we establish a strong (in)approximability for the problem, proving that no algorithm can guarantees finite approximation ratio unless P=NP. On the bright side, we design learning frameworks to capture the best probing strategies for individual network. Our extensive experiments suggest that our framework can learn efficient probing strategies that \emph{consistently} outperform previous heuristics and metric-based approaches.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。