A Label-Based Nature Heuristic Algorithm for Dynamic Community Detection

5Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The evolving patterns of the real-world can be tracked and captured by the dynamic network community structure. Some existing methods such as the multi-objective particle swarm optimization (MOPSO) use the evolutionary clustering model to detect the dynamic network community. However, the MOPSO has defects that are undesirable premature convergence and insufficient diversity of particles due to a high selection pressure. Therefore, a label-based heuristic algorithm based on the evolutionary clustering model is proposed for overcoming those shortcomings. The label propagation algorithm is adopted to initialize community structure and restrict the condition of the mutation process. The operations of crossover and mutation are used to increase the diversity of solutions and maintain the quality of community structure simultaneously. Experimental results demonstrate that the proposed method is effective and outperforms other methods in synthetic and real-world datasets.

Cite

CITATION STYLE

APA

Wang, C., Deng, Y., Li, X., Xin, Y., & Gao, C. (2019). A Label-Based Nature Heuristic Algorithm for Dynamic Community Detection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11671 LNAI, pp. 621–632). Springer Verlag. https://doi.org/10.1007/978-3-030-29911-8_48

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free