带放大镜的图上行走:基于加权随机游动的分层抽样
Walking on a Graph with a Magnifying Glass: Stratified Sampling via Weighted Random Walks
摘要:
我们的目标是通过爬行对大型未知图的节点集进行采样,以准确地估计给定的感兴趣度量。我们设计了一个适当定义的加权图,实现高效率的优先爬行那些节点和边缘,传达更多的信息,关于目标度量的随机游走。我们的方法首先采用分层理论,找到最佳的节点权重,对于一个给定的估计问题,独立采样器下。虽然在独立采样下是最佳的,但由于图的结构引起的约束,这些权重在图爬行下可能是不切实际的。因此,我们的随机游走的边缘权重应该选择,以导致一个平衡的分布,在独立采样器下近似最佳权重和实现快速收敛之间取得平衡。我们提出了一种启发式的方法(分层加权随机游走,或S-WRW),实现这一目标,同时只使用有限的信息的图形结构和节点属性。我们评估我们的技术在模拟和实验中,通过收集Facebook的大学用户的样本。我们表明,S-WRW需要13-15倍的样本比简单的重新加权随机游走(RW),以达到相同的估计精度的度量范围。
英文摘要:
Our objective is to sample the node set of a large unknown graph via crawling, to accurately estimate a given metric of interest. We design a random walk on an appropriately defined weighted graph that achieves high efficiency by preferentially crawling those nodes and edges that convey greater information regarding the target metric. Our approach begins by employing the theory of stratification to find optimal node weights, for a given estimation problem, under an independence sampler. While optimal under independence sampling, these weights may be impractical under graph crawling due to constraints arising from the structure of the graph. Therefore, the edge weights for our random walk should be chosen so as to lead to an equilibrium distribution that strikes a balance between approximating the optimal weights under an independence sampler and achieving fast convergence. We propose a heuristic approach (stratified weighted random walk, or S-WRW) that achieves this goal, while using only limited information about the graph structure and the node properties. We evaluate our technique in simulation, and experimentally, by collecting a sample of Facebook college users. We show that S-WRW requires 13-15 times fewer samples than the simple re-weighted random walk (RW) to achieve the same estimation accuracy for a range of metrics.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。