A community detection algorithm for dynamic networks is proposed to overcome the limitation that the current node-based dynamic community detection algorithm is difficult to identify the stable community structure. The algorithm uses link clustering technique and gets a link graph structure of the network
and then the complex incremental information in the dynamic network such as addition and removing of nodes and edges are simplified into addition and removing of links. An improved link partition density function is proposed to process a link in the incremental information and decide whether the link should be joined into the community based on the existing community structure to get the optimal community structure. At the end
the algorithm transforms the optimal link community structure into a node-based community structure. Experimental results and comparisons with the node-based community detection algorithm show that the algorithm can get the stable community structure and the modularity and NMI can raise at least 0.19 and 0.13
respectively
and that the efficiency of the algorithm is superior to the dynamic node-based community detection algorithms.
WANG Xiaofan. An overview of algorithms for analyzing community structure in complex networks[J]. Complex Systems and Complexity Science, 2008, 5(3): 1-12.
CHEN Guoqiang, WANG Yuping. Overlapping community detection of complex networks based on discrete particle swarm algorithm[J]. Journal of Xi'an Jiaotong University, 2013, 47(1): 107-113.
TANG L, LIU H, ZHANG J. Identifying evolving groups in dynamic multimode networks[J]. IEEE Transactions on Knowledge and Data Engineering, 2012, 24(1): 72-85.
TANTIPATHANANANDH C, BERGER-WOLF T, KEMNE D. A framework for community identification in dynamic social networks[C]∥Proceedings of the 13th ACM International Conference on Knowledge discovery and Data Mining. New York, USA: ACM, 2007: 717-726.
GONG M G, ZHANG L J, MA J, et al. Community detection in dynamic social networks based on multi-objective immune algorithm[J]. Journal of Computer Science and Technology, 2012, 27(3): 455-467.
NGUYEN N P, DINH T N, XUAN Y, et al. Adaptive algorithms for detecting community structure in dynamic social networks[C]∥Proceedings IEEE INFOCOM. Piscataway, NJ, USA: IEEE, 2011: 2282-2290.
LI D, DING Y, SHUAI X, et al. Adding community and dynamics to topic models[J]. Journal of Informetrics, 2012, 6(2): 237-253.
SHAN Bo, JIANG Shouxu, ZHANG Shuo, et al. IC: incremental algorithm for community identification in dynamic social network[J]. Journal of Software, 2009, 20(1): 184-192.
BASSETT D S, PORTER M A, WYMBS N F, et al. Robust detection of dynamic community structure in networks[EB/OL].[2013-03-14]. http:∥dx.doi.org/10.1063/1.4790830.
AHN Y Y, BAGROW J P, LEHMANN S. Link communities reveal multiscale complexity in networks[J]. Nature, 2010, 466(7307): 761-764.
SHI C, CAI Y, FU D, et al. A link clustering based overlapping community detection algorithm[J]. Data Knowledge Engineering, 2013, 87(1): 394-404.
DINH T N, XUAN Y, THAI M T. Towards social-aware routing in dynamic communication networks[C]∥Proceedings of IEEE 28th International Conference on Performance Computing and Communications. Piscataway, NJ, USA: IEEE, 2009: 161-168.
YANG T, CHI Y, ZHU S, et al. Detecting communities and their evolutions in dynamic social networks: a Bayesian approach[J]. Machine Learning, 2011, 82(2): 157-189.