基于改进对称二值非负矩阵分解的重叠社区发现方法

Overlapping community detection method based on improved symmetric binary nonnegative matrix factorization

针对复杂网络社区结构具有重叠性的问题,目前已提出许多不同类型的解决方法,其中基于对称二值非负矩阵分解(SBNMF)的重叠社区发现方法是具有代表性的方法。然而,SBNMF在面对社区内部链接稀疏的网络时,其重叠社区发现性能低下,为此提出一种基于改进SBNMF(ISBNMF)的重叠社区发现方法。首先利用对称非负矩阵分解得到的因子矩阵构建社区内部链接稠密的新网络,然后再使用基于Frobenius范数的SBNMF模型对新网络的邻接矩阵进行分解,最后通过网格搜索法或梯度下降法得到可以显式指示节点的社区隶属关系的二值矩阵。在人工合成的和真实的网络数据集上进行大量实验,结果表明ISBNMF的社区发现性能优于SBNMF和其他代表性方法。

To solve the problem of overlapping community detection in complex networks,many types of methods have been proposed,and Symmetric Binary Nonnegative Matrix Factorization(SBNMF)based overlapping community detection method is one of the most representative methods.However,SBNMF performs poorly when dealing with complex networks with sparse links within communities.In view of this,an Improved SBNMF(ISBNMF)based overlapping community detection method was proposed.Firstly,the factor matrix obtained by the symmetric nonnegative matrix factorization was used to construct a new network with dense links within communities.Then,the SBNMF model based on Frobenius norm was used to factorize the adjacency matrix of the new network.Finally,a binary matrix that can explicitly indicate the community membership of nodes was obtained by means of grid search method or gradient descent method.Extensive experiments were conducted on synthetic and real network datasets.The results show that ISBNMF performs better than SBNMF and other representative methods.