arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0906.0060cs.SIcs.NIphysics.data-anphysics.soc-phstat.ME
收藏

Facebook漫步:在线社交网络用户的统一抽样

A Walk in Facebook: Uniform Sampling of Users in Online Social Networks

Minas Gjoka, Maciej Kurant, Carter T. Butts, Athina Markopoulou

摘要:

我们在本文中的目标是开发一个实用的框架,以获得一个统一的样本的用户在一个在线的社交网络(OSN)通过爬行其社会图。这样的示例允许估计任何用户属性和一些拓扑属性。为此,首先,我们考虑和比较几个候选爬行技术。可以产生近似均匀样本的两种方法是Metropolis-Hasting随机游走(MHRW)和重新加权随机游走(RWRW)。两者都有优点和缺点,我们通过相互比较以及与“基本事实”的比较来证明这一点。相比之下,使用广度优先搜索(BFS)或未经调整的随机游走(RW)会导致严重偏差的结果。其次,除了离线性能评估,我们引入在线正式收敛诊断,以评估样本质量在数据汇集过程中。我们展示了如何使用这些诊断来有效地确定何时随机游走样本具有足够的大小和质量。第三,作为案例研究,我们将上述方法应用于Facebook,并收集了第一个,据我们所知,Facebook用户的代表性样本。我们将其公开,并使用它来描述Facebook的几个关键属性。

英文摘要:

Our goal in this paper is to develop a practical framework for obtaining a uniform sample of users in an online social network (OSN) by crawling its social graph. Such a sample allows to estimate any user property and some topological properties as well. To this end, first, we consider and compare several candidate crawling techniques. Two approaches that can produce approximately uniform samples are the Metropolis-Hasting random walk (MHRW) and a re-weighted random walk (RWRW). Both have pros and cons, which we demonstrate through a comparison to each other as well as to the "ground truth." In contrast, using Breadth-First-Search (BFS) or an unadjusted Random Walk (RW) leads to substantially biased results. Second, and in addition to offline performance assessment, we introduce online formal convergence diagnostics to assess sample quality during the data collection process. We show how these diagnostics can be used to effectively determine when a random walk sample is of adequate size and quality. Third, as a case study, we apply the above methods to Facebook and we collect the first, to the best of our knowledge, representative sample of Facebook users. We make it publicly available and employ it to characterize several key properties of Facebook.

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

↑