arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1406.0067stat.MLcs.SImath.STphysics.soc-phstat.TH
收藏

基于低秩近似的网络社区检测优化

Optimization via Low-rank Approximation for Community Detection in Networks

Can M. Le, Elizaveta Levina, Roman Vershynin

摘要:

社区发现是网络分析的基本问题之一,目前已经提出了许多方法。大多数基于模型或基于准则的方法必须解决离散标签集上的优化问题才能找到社区,这在计算上是不可行的。一些快速谱算法已被提出用于特定的方法或模型,但仅在个案的基础上。在这里,我们提出了一种通用的方法,通过将标签集投影到一个子空间上,近似于预期邻接矩阵的前导特征向量,来最大化离散标签上的网络邻接矩阵的函数。这种在低维空间上的投影使得标签的可行集合更小,优化问题更容易。我们证明了这种方法的一般结果,并展示了如何将其应用到以前提出的几个社区检测标准,建立其一致性的标签估计在每种情况下,并展示了网络的光谱特性和各种基于模型的社区检测方法之间的基本联系。仿真和应用程序的真实世界的数据,以证明我们的方法在很宽的参数范围内的多个问题表现良好。

英文摘要:

Community detection is one of the fundamental problems of network analysis, for which a number of methods have been proposed. Most model-based or criteria-based methods have to solve an optimization problem over a discrete set of labels to find communities, which is computationally infeasible. Some fast spectral algorithms have been proposed for specific methods or models, but only on a case-by-case basis. Here we propose a general approach for maximizing a function of a network adjacency matrix over discrete labels by projecting the set of labels onto a subspace approximating the leading eigenvectors of the expected adjacency matrix. This projection onto a low-dimensional space makes the feasible set of labels much smaller and the optimization problem much easier. We prove a general result about this method and show how to apply it to several previously proposed community detection criteria, establishing its consistency for label estimation in each case and demonstrating the fundamental connection between spectral properties of the network and various model-based approaches to community detection. Simulations and applications to real-world data are included to demonstrate our method performs well for multiple problems over a wide range of parameters.

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

↑