一次黑箱抽样的网络聚类近似算法
Network Clustering Approximation Algorithm Using One Pass Black Box Sampling
摘要:
在网络中找到一个好的顶点聚类,其中同一聚类中的顶点比不同聚类中的顶点连接得更紧密,这是一个有用的,重要的和经过充分研究的任务。许多聚类算法扩展性很好,但它们并不是设计用于具有数十亿节点或更多节点的互联网规模网络。我们研究了一个最快和最节省内存的算法-基于随机边诱导子图中连通分量的聚类。当定义的成本的聚类是它的距离从这样一个随机聚类,我们表明,这个令人惊讶的简单算法给出了一个解决方案,是在一个预期的因素的两个或三个最佳的两个自然距离函数。事实上,这种近似保证适用于聚类上存在概率分布的任何问题。然后,我们研究该算法的行为在社会网络信任推理的背景下。
英文摘要:
Finding a good clustering of vertices in a network, where vertices in the same cluster are more tightly connected than those in different clusters, is a useful, important, and well-studied task. Many clustering algorithms scale well, however they are not designed to operate upon internet-scale networks with billions of nodes or more. We study one of the fastest and most memory efficient algorithms possible - clustering based on the connected components in a random edge-induced subgraph. When defining the cost of a clustering to be its distance from such a random clustering, we show that this surprisingly simple algorithm gives a solution that is within an expected factor of two or three of optimal with either of two natural distance functions. In fact, this approximation guarantee works for any problem where there is a probability distribution on clusterings. We then examine the behavior of this algorithm in the context of social network trust inference.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。