Identifying Communities in Dynamic Networks Using Information Dynamics
Open Access
Abstract
Identifying communities in dynamic networks is essential for exploring the latent network structures, understanding network functions, predicting network evolution, and discovering abnormal network events. Many dynamic community detection methods have been proposed from different viewpoints. However, identifying the community structure in dynamic networks is very challenging due to the difficulty of parameter tuning, high time complexity and detection accuracy decreasing as time slices increase. In this paper, we present a dynamic community detection framework based on information dynamics and develop a dynamic community detection algorithm called DCDID (dynamic community detection based on information dynamics), which uses a batch processing technique to incrementally uncover communities in dynamic networks. DCDID employs the information dynamics model to simulate the exchange of information among nodes and aims to improve the efficiency of community detection by filtering out the unchanged subgraph. To illustrate the effectiveness of DCDID, we extensively test it on synthetic and real-world dynamic networks, and the results demonstrate that the DCDID algorithm is superior to the representative methods in relation to the quality of dynamic community detection.Keywords
Funding Information
- National Science and Technology Major Project of China (2017ZX06002005)
- Science and Technology Research Project of the Science and Technology Department of Henan Province (182102210472)
- Fundamental Research Funds for Central Universities of the Central South University (2017zzts139)
This publication has 37 references indexed in Scilit:
- Community Detection Method Based on Node Density, Degree Centrality, and K-Means Clustering in Complex NetworkEntropy, 2019
- Synchronization-based clustering on evolving data streamInformation Sciences, 2019
- Identifying multi-scale communities in networks by asymptotic surpriseJournal of Statistical Mechanics: Theory and Experiment, 2019
- Evolving the attribute flow for dynamical clustering in signed networksChaos, Solitons & Fractals, 2018
- Community Detection based on Distance Dynamics2015
- Fast unfolding of communities in large networksJournal of Statistical Mechanics: Theory and Experiment, 2008
- Maps of random walks on complex networks reveal community structureProceedings of the National Academy of Sciences of the United States of America, 2008
- Near linear time algorithm to detect community structures in large-scale networksPhysical Review E, 2007
- Uncovering the overlapping community structure of complex networks in nature and societyNature, 2005
- Community structure in social and biological networksProceedings of the National Academy of Sciences of the United States of America, 2002