arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0904.3761cs.DScs.DM
收藏

近似三角形计数

Approximate Triangle Counting

Charalampos E. Tsourakakis, Mihail N. Kolountzakis, Gary L. Miller

摘要:

三角形计数是图挖掘中的一个重要问题。在复杂网络分析中,顶点的聚类系数和图的传递率是两个常用的度量。此外,三角形已成功地用于几个现实世界的应用。然而,精确的三角形计数是一个昂贵的计算。在本文中,我们提出了一个实用的抽样算法计数三角形图的分析。我们的分析产生的采样率的最佳值,从而导致巨大的加速范围从\emph{2800} x到\emph{70000} x时,应用于现实世界的网络。同时,估计的准确性是极好的。我们的贡献包括在具有数百万个节点和边的图上进行实验,在那里我们展示了我们提出的方法的实用性。最后,我们的算法的实现是\pegasus库的一部分(代码和数据集可在(http://www.cs.cmu.edu/jpctsourak/)获得。)一个在Hadoop中实现的Peta-Graph Mining库,Hadoop是Mapreduce的开源版本。

英文摘要:

Triangle counting is an important problem in graph mining. Clustering coefficients of vertices and the transitivity ratio of the graph are two metrics often used in complex network analysis. Furthermore, triangles have been used successfully in several real-world applications. However, exact triangle counting is an expensive computation. In this paper we present the analysis of a practical sampling algorithm for counting triangles in graphs. Our analysis yields optimal values for the sampling rate, thus resulting in tremendous speedups ranging from \emph{2800}x to \emph{70000}x when applied to real-world networks. At the same time the accuracy of the estimation is excellent. Our contributions include experimentation on graphs with several millions of nodes and edges, where we show how practical our proposed method is. Finally, our algorithm's implementation is a part of the \pegasus library (Code and datasets are available at (http://www.cs.cmu.edu/~ctsourak/).) a Peta-Graph Mining library implemented in Hadoop, the open source version of Mapreduce.

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

↑