A multi-objective optimization approach for overlapping dynamic community detection

Community detection is a valuable tool for studying the function and dynamic structure of most real-world networks. Existing techniques either concentrate on the network's topological structure or node properties without adequately addressing the dynamic aspect. As a result, in this research, we present a unique technique called Multi-Objective Optimization Overlapping Dynamic Community Detection (MOOODCD) that leverages both the topological structure and node attributes of dynamic networks. By incorporating the Dirichlet distribution to control network dynamics, we formulate dynamic community detection as a non-negative matrix factorization problem. The block coordinate ascent method is used to estimate the latent elements of the model. Our experiments on artificial and real networks indicate that MOOODCD detects overlapping communities in dynamic networks with acceptable precision and scalability.