Decomposition-Based Multiobjective Evolutionary Algorithm for Community Detection in Dynamic Social Networks

الملخص EN

Community structure is one of the most important properties in social networks.

In dynamic networks, there are two conflicting criteria that need to be considered.

One is the snapshot quality, which evaluates the quality of the community partitions at the current time step.

The other is the temporal cost, which evaluates the difference between communities at different time steps.

In this paper, we propose a decomposition-based multiobjective community detection algorithm to simultaneously optimize these two objectives to reveal community structure and its evolution in dynamic networks.

It employs the framework of multiobjective evolutionary algorithm based on decomposition to simultaneously optimize the modularity and normalized mutual information, which quantitatively measure the quality of the community partitions and temporal cost, respectively.

A local search strategy dealing with the problem-specific knowledge is incorporated to improve the effectiveness of the new algorithm.

Experiments on computer-generated and real-world networks demonstrate that the proposed algorithm can not only find community structure and capture community evolution more accurately, but also be steadier than the two compared algorithms.