A Non-dominated Neighbor Immune Algorithm for Community Detection in Networks

摘要

The study of complex networks has received an enormous amount of attention from the scientific community in recent years. In this paper, we propose a multi-objective approach, named NNIA-Net, to discover communities in networks by employing Non-dominated Neighbor Immune Algorithm (NNIA). Our algorithm optimizes two objectives to find communities in networks - groups of vertices within which connections are dense, but between which connections are sparser. The method can produce a series of solutions which represent various divisions to the networks at different hierarchical levels. The number of subdivisions is automatically determined by the non-dominated individuals resulting from our algorithm. We demonstrate that our algorithm is highly efficient at discovering quality community structure in both synthetic and real-world network data. What's more, a new initialization method is proposed to improve the traditional initialization method by about 30% in running time.