PES:流三角形估计中的优先边缘采样
PES: Priority Edge Sampling in Streaming Triangle Estimation
摘要:
三角形个数(以下记为$Δ$)是分析海量图的一个重要度量。它也被用来计算网络中的聚类系数。本文提出了一种新的算法称为PES(优先边缘采样)来估计三角形的数量在流模型中,我们需要最小化的内存窗口。PES结合了边缘采样和储层采样。与最先进的流媒体算法相比,PES始终优于。结果在48个不同领域和结构的大型现实网络中得到了广泛的验证。性能比可以高达11。更重要的是,该比率几乎随数据大小呈指数级增长。这在大数据时代尤其重要-虽然我们可以容忍现有的算法用于较小的数据集,但我们的方法在采样非常大的数据时是不可或缺的。除了经验比较,我们还证明了估计是无偏的,并推导出方差。
英文摘要:
The number of triangles (hereafter denoted by $Δ$) is an important metric to analyze massive graphs. It is also used to compute clustering coefficient in networks. This paper proposes a new algorithm called PES (Priority Edge Sampling) to estimate the number of triangles in the streaming model where we need to minimize the memory window. PES combines edge sampling and reservoir sampling. Compared with the state-of-the-art streaming algorithms, PES outperforms consistently. The results are verified extensively in 48 large real-world networks in different domains and structures. The performance ratio can be as large as 11. More importantly, the ratio grows with data size almost exponentially. This is especially important in the era of big data--while we can tolerate existing algorithms for smaller datasets, our method is indispensable when sampling very large data. In addition to empirical comparisons, we also proved that the estimator is unbiased, and derived the variance.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。