arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1206.4952cs.SIcs.DBphysics.soc-phstat.AP
收藏

从社交活动流中进行空间有效的采样

Space-Efficient Sampling from Social Activity Streams

Nesreen K. Ahmed, Jennifer Neville, Ramana Kompella

摘要:

为了有效地研究网络域的特性并支持网络系统的开发(例如,在网络上操作的算法、协议),通常需要从大型复杂网络中采样代表性子图。虽然最近的子图采样方法已被证明工作良好,但它们专注于从内存驻留图中采样,并假设采样算法可以访问整个图,以便决定选择哪些节点/边。然而,许多大规模网络数据集太大和/或动态而不能使用主存储器(例如,电子邮件、推特、墙贴)。在这项工作中,我们制定了从大型图形流采样的问题。我们提出了一个流图采样算法,动态地保持一个代表性的样本在水库为基础的设置。我们评估我们提出的方法的有效性经验使用几个真实世界的数据集。在所有数据集中,我们发现我们的方法产生的样本更好地保留了原始图分布。

英文摘要:

In order to efficiently study the characteristics of network domains and support development of network systems (e.g. algorithms, protocols that operate on networks), it is often necessary to sample a representative subgraph from a large complex network. Although recent subgraph sampling methods have been shown to work well, they focus on sampling from memory-resident graphs and assume that the sampling algorithm can access the entire graph in order to decide which nodes/edges to select. Many large-scale network datasets, however, are too large and/or dynamic to be processed using main memory (e.g., email, tweets, wall posts). In this work, we formulate the problem of sampling from large graph streams. We propose a streaming graph sampling algorithm that dynamically maintains a representative sample in a reservoir based setting. We evaluate the efficacy of our proposed methods empirically using several real-world data sets. Across all datasets, we found that our method produce samples that preserve better the original graph distributions.

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

↑