arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.04249cs.DBcs.DCcs.DScs.SI
收藏

CoCoS:图流中快速准确的分布式三角形计数

CoCoS: Fast and Accurate Distributed Triangle Counting in Graph Streams

Kijung Shin, Euiwoong Lee, Jinoh Oh, Mohammad Hammoud, Christos Faloutsos

摘要:

给定一个图流,我们如何使用多台机器和有限的存储来估计其中的三角形数量?具体来说,应该如何在机器上处理和采样边缘,以实现快速准确的估计?三角形的计数(即,大小为3的集团)已被证明在包括异常检测、社区发现和链接推荐的许多应用中是有用的。对于大型动态图中的三角形计数,最近的工作主要集中在流式算法和分布式算法上,但很少关注它们的组合,以实现“两全其美”。在这项工作中,我们提出了CoCoS,一种快速准确的分布式流算法,用于估计全局三角形的计数(即,所有三角形)和与每个节点关联的局部三角形。在输入流上进行一次传递,COCOS仔细地处理并存储多台机器上的边,以便最大限度地减少计算和存储资源的冗余使用。与基线相比,CoCoS(a)准确:估计误差最多小39倍,(b)快速:最多快10.4倍,随输入流的大小线性扩展,(c)理论上合理:产生无偏估计。

英文摘要:

Given a graph stream, how can we estimate the number of triangles in it using multiple machines with limited storage? Specifically, how should edges be processed and sampled across the machines for rapid and accurate estimation? The count of triangles (i.e., cliques of size three) has proven useful in numerous applications, including anomaly detection, community detection, and link recommendation. For triangle counting in large and dynamic graphs, recent work has focused largely on streaming algorithms and distributed algorithms but little on their combinations for "the best of both worlds". In this work, we propose CoCoS, a fast and accurate distributed streaming algorithm for estimating the counts of global triangles (i.e., all triangles) and local triangles incident to each node. Making one pass over the input stream, COCOS carefully processes and stores the edges across multiple machines so that the redundant use of computational and storage resources is minimized. Compared to baselines, CoCoS is (a) Accurate: giving up to 39X smaller estimation error, (b) Fast: up to 10.4X faster, scaling linearly with the size of the input stream, and (c) Theoretically sound: yielding unbiased estimates.

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

↑