An incremental method to detect communities in dynamic evolving social networks

Detecting communities in dynamic evolving networks is of great interest. It has received tremendous attention from researchers. One promising solution is to update communities incrementally taking the historical information into consideration. However, most of the existing methods are only suitable...

Full description

Saved in:
Bibliographic Details
Published in:Knowledge-based systems 2019-01, Vol.163, p.404-415
Main Authors: Zhao, Zhongying, Li, Chao, Zhang, Xuejian, Chiclana, Francisco, Viedma, Enrique Herrera
Format: Article
Language:English
Subjects:
Communities
Community detection
Dynamic evolving network
Evolution
Graph theory
Information
Knowledge
Networks
Online interaction
Social network analysis
Social network mining
Social networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Detecting communities in dynamic evolving networks is of great interest. It has received tremendous attention from researchers. One promising solution is to update communities incrementally taking the historical information into consideration. However, most of the existing methods are only suitable for the case of one node adding or one edge adding. Factually, new data are always generated continuously with subgraphs joining simultaneously in dynamic evolving networks. To address the above problem, we present an incremental method to detect communities by handling subgraphs. We first make a comprehensive analysis and propose four types of incremental elements. Then we propose different updating strategies. Finally, we present the algorithms to detect communities incrementally in dynamic evolving networks. The experimental results on real-world data sets indicate that the proposed method is effective and has superior performance compared with several widely used methods.
ISSN:0950-7051
1872-7409
DOI:10.1016/j.knosys.2018.09.002