存在任意离群节点的鲁棒且计算可行的社区检测
Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
摘要:
社区检测是网络数据分析中的一个重要问题,其目的是根据所观察到的无向边将给定图中的$N$节点聚类为$r$不同的组。在本文中,流行的随机块模型(SBM)扩展到广义随机块模型(GSBM),允许敌对离群节点,这是与图中的其他节点以任意的方式连接。在此模型下,我们介绍了一个程序,使用凸优化,其次是$k$ -均值算法与$k=r$。分析了该方法的理论和数值特性。给出了在聚类数随$N$增长的情况下,该方法能够以较小的误分率准确检测出社区的理论保证.这一理论结果承认最著名的结果在文献中的计算上可行的社区检测SBM没有离群值。数值结果表明,该方法具有计算速度快、鲁棒性强的特点,而一些常用的快速社团检测算法,如基于邻接矩阵或图拉普拉斯算子的谱聚类算法,由于存在少量的离群点,可能无法检测出主要的簇.我们对我们的方法进行了轻微的修改,以政治博客数据集,表明我们的方法在实践中是称职的,并与文献中现有的计算可行的方法相媲美。据作者所知,我们的结果是第一次在文献中的集群社区与快速增长的数字下的GSBM任意离群节点存在的一部分。
英文摘要:
Community detection, which aims to cluster $N$ nodes in a given graph into $r$ distinct groups based on the observed undirected edges, is an important problem in network data analysis. In this paper, the popular stochastic block model (SBM) is extended to the generalized stochastic block model (GSBM) that allows for adversarial outlier nodes, which are connected with the other nodes in the graph in an arbitrary way. Under this model, we introduce a procedure using convex optimization followed by $k$-means algorithm with $k=r$. Both theoretical and numerical properties of the method are analyzed. A theoretical guarantee is given for the procedure to accurately detect the communities with small misclassification rate under the setting where the number of clusters can grow with $N$. This theoretical result admits to the best-known result in the literature of computationally feasible community detection in SBM without outliers. Numerical results show that our method is both computationally fast and robust to different kinds of outliers, while some popular computationally fast community detection algorithms, such as spectral clustering applied to adjacency matrices or graph Laplacians, may fail to retrieve the major clusters due to a small portion of outliers. We apply a slight modification of our method to a political blogs data set, showing that our method is competent in practice and comparable to existing computationally feasible methods in the literature. To the best of the authors' knowledge, our result is the first in the literature in terms of clustering communities with fast growing numbers under the GSBM where a portion of arbitrary outlier nodes exist.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。