Indexed by:
Abstract:
The existence of communities in various complex networks is ubiquitous in all aspects of people’s living. Hence, it is crucial to uncover communities accurately, which is one of the hottest research areas in the field of network analysis. Particularly, complex networks are usually in continuous change so that it is more realistic to uncover dynamic communities. In this study, an algorithm based on node contribution for uncovering dynamic communities is proposed. Firstly, the seed nodes are selected via node local fitness in the network, thus guaranteeing that the selected seeds are central nodes of communities. Secondly, a static algorithm is used to obtain communities in initial snapshot of the network. Finally, node contribution is proposed to incrementally uncover communities in non-initial snapshots of the network. The experimental results reveal that our method outperforms all other comparison algorithms in both artificial and real datasets. © 2019, Springer Nature Singapore Pte Ltd.
Keyword:
Reprint 's Address:
Email:
Version:
Source :
ISSN: 1865-0929
Year: 2019
Volume: 1042 CCIS
Page: 363-376
Language: English
Cited Count:
SCOPUS Cited Count: 3
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 0
Affiliated Colleges: