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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Newman, M.E.J.: Detecting community structure in networks. Eur. Phys. J. B 38(2), 321–330 (2004)
Fortunato, S., Hric, D.: Community detection in networks: a user guide. Phys. Rep. 659, 1–44 (2016)
Mitra, B., Tabourier, L., Roth, C.: Intrinsically dynamic network communities. Comput. Netw. 56(3), 1041–1053 (2012)
Chakrabarti, D., Kumar, R., Tomkins, A.: Evolutionary clustering. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 554–560. ACM, Philadelphia (2006)
Li, X., Wu, B., Guo, Q., et al.: Dynamic community detection algorithm based on incremental identification. In: 15th IEEE International Conference on Data Mining Workshop (ICDMW), pp. 900–907. IEEE, Atlantic City (2015)
Zakrzewska, A., Bader, D.A.: A dynamic algorithm for local community detection in graphs. In: Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 559–564. ACM, Paris (2015)
Hu, Y., Yang, B., Lv, C.: A local dynamic method for tracking communities and their evolution in dynamic networks. Knowl.-Based Syst. 110, 176–190 (2016)
DiTursi, D.J., Ghosh, G., Bogdanov, P.: Local community detection in dynamic networks. In: 2017 IEEE International Conference on Data Mining (ICDM), pp. 847–852. IEEE, New Orleans (2017)
Javadi, S.H.S., Gharani, P., Khadivi, S.: Detecting community structure in dynamic social networks using the concept of leadership. In: Amini, M.H., Boroojeni, K.G., Iyengar, S.S., Pardalos, P.M., Blaabjerg, F., Madni, A.M. (eds.) Sustainable Interdependent Networks. SSDC, vol. 145, pp. 97–118. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-74412-4_7
Lancichinetti, A., Fortunato, S., Kertesz, J.: Detecting the overlapping and hierarchical community structure in complex networks. New J. Phys. 11(3), 033015 (2009)
Klimt, B., Yang, Y.: The Enron Corpus: A New Dataset for Email Classification Research. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) ECML 2004. LNCS (LNAI), vol. 3201, pp. 217–226. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-30115-8_22
Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, pp. 177–187. ACM, Chicago (2005)
Greene, D., Doyle, D., Cunningham, P.: Tracking the evolution of communities in dynamic social networks. In: 2010 International Conference on Advances in Social Networks Analysis and Mining, pp. 176–183. IEEE, Odense (2010)
Nguyen, N.P., Dinh, T.N., Tokala, S., et al.: Overlapping communities in dynamic networks: their detection and mobile applications. In: Proceedings of the 17th Annual International Conference on Mobile Computing and Networking, pp. 85–96. ACM, Las Vegas (2011)
Shang, J., Liu, L., Xie, F., et al.: A real-time detecting algorithm for tracking community structure of dynamic networks. arXiv preprint arXiv:1407.2683 (2014)
Nguyen, N.P., Dinh, T.N., Shen, Y., et al.: Dynamic social community detection and its applications. PLoS ONE 9(4), e91431 (2014)
Shen, H., Cheng, X., Cai, K., et al.: Detect overlapping and hierarchical community structure in networks. Phys. A: Stat. Mech. Appl. 388(8), 1706–1712 (2009)
Danon, L., Diaz-Guilera, A., Duch, J., et al.: Comparing community structure identification. J. Stat. Mech: Theory Exp. 2005(09), P09008 (2005)
Acknowledgments
This work is partly supported by the National Natural Science Foundation of China under Grant No. 61300104, No. 61300103 and No. 61672159, the Fujian Province High School Science Fund for Distinguished Young Scholars under Grant No. JA12016, the Fujian Natural Science Funds for Distinguished Young Scholar under Grant No. 2015J06014, the Fujian Industry-Academy Cooperation Project under Grant No. 2018H6010 and No. 2017H6008, and Haixi Government Big Data Application Cooperative Innovation Center.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Guo, K., He, L., Huang, J., Chen, Y., Lin, B. (2019). A Local Dynamic Community Detection Algorithm Based on Node Contribution. In: Sun, Y., Lu, T., Yu, Z., Fan, H., Gao, L. (eds) Computer Supported Cooperative Work and Social Computing. ChineseCSCW 2019. Communications in Computer and Information Science, vol 1042. Springer, Singapore. https://doi.org/10.1007/978-981-15-1377-0_28
Download citation
DOI: https://doi.org/10.1007/978-981-15-1377-0_28
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-1376-3
Online ISBN: 978-981-15-1377-0
eBook Packages: Computer ScienceComputer Science (R0)
