To understand time-evolving networks, researchers should not only concentrate on the community structures, an essential property of complex networks, in each snapshot, but also study the internal evolution of the entire networks. Temporal communities provide insights into such mechanism, i.e., how the communities emerge, expand, shrink, merge, split and decay over time. Based on the symmetric nonnegative matrix factorization (SNMF), we present a dynamic model to detect temporal communities, which not only could find a well community structure in a given snapshot but also demands the results bear some similarity to the partition obtained from the previous snapshot. Moreover, our method can handle the situation that of the number of community changes in the networks. Also, a gradient descent algorithm is proposed to optimize the objective function of the model. Experimental results on both the synthetic and real-world networks indicate that our method outperforms the state-of-art methods for temporal community detection.
Correction: Limited-Memory Fast Gradient Descent Method for Graph Regularized Nonnegative Matrix Factorization
