A multiobjective discrete cuckoo search algorithm for community detection in dynamic networks
- 307 Downloads
Evolutionary clustering is a popular method for community detection in dynamic networks by introducing the concept of temporal smoothness. Some evolutionary based clustering approaches need an input parameter to control the preference degree of snapshot and temporal cost. To break the limitation of parameter selection and increase accuracy of detecting communities, we propose a multiobjective discrete cuckoo search algorithm to discover communities in dynamic networks. Firstly, ordered neighbor list method is used to encode the location of nest for population initialization. Secondly, a discrete framework of cuckoo search algorithm is proposed with a modified nest location updating strategy and abandon operator. Finally, based on the proposed discrete framework, a multiobjective discrete cuckoo search algorithm is proposed by integrating the non-dominated sorting method and the crowding distance method. Experimental results on synthetic and real networks demonstrate that the proposed algorithm is effective and has higher accuracy than other compared algorithms.
KeywordsCommunity detection Dynamic network Multiobjective optimization Cuckoo search algorithm
We would like to thank the anonymous referees for their many valuable suggestions and comments. This work is supported by the National Natural Science Foundation of China (Grant No. 61373123), Key Development Program for Science and Technology of Jilin Province, China (Grant No. 20150414004GH).
Compliance with ethical standards
Conflict of interest
The authors declare that they have no conflict of interest.
- Chakrabarti D, Kumar R, Tomkins A (2006) Evolutionary clustering. In: Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining, pp 554–560Google Scholar
- Chi Y, Song XD, Zhou D, Hino K, Tseng BL (2007) Evolutionary spectral clustering by incorporating temporal smoothness. In: Proceedings of the 13th international conference on knowledge discovery and data mining, pp 153–162Google Scholar
- Danon L, Daz-Guilera A, Duch J, Arenas A (2005) Comparing community structure identification. J Stat Mech Theory Exp 1–10Google Scholar
- Folino F, Pizzuti C (2010) A multiobjective and evolutionary clustering method for dynamic networks. In: Proceedings of the international conference on advances in social networks analysis and mining, pp 256–263Google Scholar
- Gong MG, Hou T, Fu B, Jiao LC (2011) A non-dominated neighbor immune algorithm for community detection in networks. In: Proceedings of the 13th annual conference on genetic and evolutionary computation (GECCO’JI), pp 1627–1634Google Scholar
- Kim M, Han J (2009) A particle-and-density based evolutionary clustering method for dynamic networks. Proc Int Conf Very Large Data Bases 2(1):622–633Google Scholar
- Lancichinetti A, Fortunato S (2009) Community detection algorithms: a comparative analysis. Phys Rev E 80:2142–2152Google Scholar
- Lin YR, Chi Y, Zhu S, Sundaram H, Tseng BL (2008) Facetnet: a framework for analyzing communities and their evolutions in dynamic networks. In: Proceedings of the 17th international conference on World Wide Web, pp 685–694Google Scholar
- Ma JJ, Liu J, Ma W, Gong MG, Jiao LC (2014) Decomposition-based multiobjective evolutionary algorithm for community detection in dynamic social networks. Sci World J 1–22Google Scholar
- Mantegna R (1992) Fast accurate algorithm for numerical simulation of levy stochastic process. Phys Rev E 49(5):451–458Google Scholar
- Tang L, Liu H, Zhang J, Nazeri Z (2008) Community evolution in dynamic multi-mode networks. In: Proceedings of the 14th international conference on knowledge discovery and data mining, pp 677–685Google Scholar
- Tantipathananandh C, Berger-Wolf T, Kempe D (2007) A framework for community identification in dynamic social networks. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining, pp 717–726Google Scholar
- Yang XS, Deb S (2009) Cuckoo search via lévy flights. In: Proceedings of world congress on nature biologically inspired computing, pp 210–214Google Scholar