Evolutionary Nonnegative Matrix Factorization Algorithms for Community Detection in Dynamic Networks
Abstract: Discovering evolving communities in dynamic networks is essential to important applications such as analysis for dynamic web content and disease progression. Evolutionary clustering uses the temporal smoothness framework that simultaneously maximizes the clustering accuracy at the current time step and minimizes the clustering drift between two successive time steps. In this paper, we propose se two evolutionary nonnegative matrix factorization (ENMF) frameworks for detecting dynamic communities. To address the theoretical relationship among evolutionary clustering algorithms, we first prove the equivalence relationship between ENMF and optimiz optimization ation of evolutionary modularity density. Then, we extend the theory by proving the equivalence between evolutionary spectral clustering and ENMF, which serves as the theoretical foundation for hybrid algorithms. Based on the equivalence, we propose a semi-supervised supervised ENMF (sE (sE-NMF) NMF) by incorporating a priori information into ENMF. Unlike the traditional semi semi-supervised supervised algorithms, a priori information is integrated into the objective function of the algorithm. The main advantage of the proposed algorithm is tto o escape the local optimal solution without increasing time complexity. The experimental results over a number of artificial and real world dynamic networks illustrate that the proposed method is not only more accurate but also more robust than the state state-of-the-art art approaches.