arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1701.07221cs.SI
收藏

社区感知网络稀疏化

Community-aware network sparsification

Aristides Gionis, Polina Rozenshtein, Nikolaj Tatti, Evimaria Terzi

摘要:

网络稀疏化旨在减少网络的边数,同时保持其结构属性;这些属性包括最短路径,切割,频谱测量或网络模块化。稀疏化具有多种应用,例如,加速图挖掘算法,图可视化,以及识别重要的网络边缘。在本文中,我们考虑一种新的制定网络稀疏化问题。除了网络之外,我们还考虑一组社区作为输入。我们的目标是使网络稀疏化,以便相对于给定的社区保持网络结构。我们介绍了两个变种的社区感知稀疏化问题,导致稀疏满足不同的连通性社区属性。从技术的角度来看,我们证明了硬度的结果和设计有效的近似算法。我们在大量数据集上的实验结果证明了我们算法的有效性。

英文摘要:

Network sparsification aims to reduce the number of edges of a network while maintaining its structural properties; such properties include shortest paths, cuts, spectral measures, or network modularity. Sparsification has multiple applications, such as, speeding up graph-mining algorithms, graph visualization, as well as identifying the important network edges. In this paper we consider a novel formulation of the network-sparsification problem. In addition to the network, we also consider as input a set of communities. The goal is to sparsify the network so as to preserve the network structure with respect to the given communities. We introduce two variants of the community-aware sparsification problem, leading to sparsifiers that satisfy different connectedness community properties. From the technical point of view, we prove hardness results and devise effective approximation algorithms. Our experimental results on a large collection of datasets demonstrate the effectiveness of our algorithms.

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

↑