大规模网络中的桁架分解
Truss Decomposition in Massive Networks
摘要:
k-桁架是近年来提出的一类用于网络研究的凝聚子图。虽然计算大多数凝聚子图的问题是NP-难的,但存在计算k-桁架的多项式时间算法。与计算效率也很高的k-core相比,k-truss代表了k-core的“core”,它保留了k-core的关键信息,同时过滤掉不太重要的信息。然而,现有的算法计算k-桁架处理今天的大规模网络是低效的。我们首先改进了现有的内存中的算法计算k-桁架网络的中等规模。然后,我们提出了两个I/O高效的算法来处理大规模的网络,不能适合在主存。我们在真实数据集上的实验验证了我们算法的有效性和k-truss的价值。
英文摘要:
The k-truss is a type of cohesive subgraphs proposed recently for the study of networks. While the problem of computing most cohesive subgraphs is NP-hard, there exists a polynomial time algorithm for computing k-truss. Compared with k-core which is also efficient to compute, k-truss represents the "core" of a k-core that keeps the key information of, while filtering out less important information from, the k-core. However, existing algorithms for computing k-truss are inefficient for handling today's massive networks. We first improve the existing in-memory algorithm for computing k-truss in networks of moderate size. Then, we propose two I/O-efficient algorithms to handle massive networks that cannot fit in main memory. Our experiments on real datasets verify the efficiency of our algorithms and the value of k-truss.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。