Abstract
In this paper, we propose \(\mathsf {DyPerm}\), the first dynamic community detection method which optimizes a novel community scoring metric, called permanence. \(\mathsf {DyPerm}\) incrementally modifies the community structure by updating those communities where the editing of nodes and edges has been performed, keeping the rest of the network unchanged. We present strong theoretical guarantees to show how/why mere updates on the existing community structure lead to permanence maximization in dynamic networks, which in turn decreases the computational complexity drastically. Experiments on both synthetic and six real-world networks with given ground-truth community structure show that \(\mathsf {DyPerm}\) achieves (on average) 35% gain in accuracy (based on NMI) compared to the best method among four baseline methods. \(\mathsf {DyPerm}\) also turns out to be 15 times faster than its static counterpart.
Parts of the work were partially supported by the Infosys Center for AI, IIIT Delhi, India, and the Ramanujan Fellowship, SERB, DST, India.
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
Notes
- 1.
For code and datasets, please visit https://tinyurl.com/dyperm-code.
- 2.
See supplementary [1] for the proofs of all the propositions.
- 3.
- 4.
References
Anonymized supplementary (2018). https://tinyurl.com/dyperm-si
Aktunc, R., Toroslu, I.H., Ozer, M., Davulcu, H.: A dynamic modularity based community detection algorithm for large-scale networks: DSLM. In: ASONAM, pp. 1177–1183 (2015)
Bansal, S., Bhowmick, S., Paymal, P.: Fast community detection for dynamic complex networks. In: da F. Costa, L., Evsukoff, A., Mangioni, G., Menezes, R. (eds.) CompleNet 2010. CCIS, vol. 116, pp. 196–207. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-25501-4_20
Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp. 2008(10), P10008 (2008)
Cazabet, R., Amblard, F.: Dynamic community detection. In: Alhajj, R., Rokne, J. (eds.) Encyclopedia of Social Network Analysis and Mining, pp. 404–414. Springer, New York (2014). https://doi.org/10.1007/978-1-4614-6170-8
Chakrabarti, D., Kumar, R., Tomkins, A.: Evolutionary clustering. In: SIGKDD, pp. 554–560 (2006)
Chakraborty, T., Dalmia, A., Mukherjee, A., Ganguly, N.: Metrics for community analysis: a survey. ACM Comput. Surv. 50(4), 54:1–54:37 (2017)
Chakraborty, T., Srinivasan, S., Ganguly, N., Mukherjee, A., Bhowmick, S.: On the permanence of vertices in network communities. In: SIGKDD, pp. 1396–1405 (2014)
Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3–5), 75–174 (2010)
Li, X., Wu, B., Guo, Q., Zeng, X., Shi, C.: Dynamic community detection algorithm based on incremental identification. In: ICDMW, pp. 900–907 (2015)
Mitra, B., Tabourier, L., Roth, C.: Intrinsically dynamic network communities. Comput. Netw. 56(3), 1041–1053 (2012)
Nguyen, N.P., Dinh, T.N., Xuan, Y., Thai, M.T.: Adaptive algorithms for detecting community structure in dynamic social networks. In: INFOCOM, pp. 2282–2290 (2011)
Shang, J., Liu, L., Li, X., Xie, F., Wu, C.: Targeted revision: a learning-based approach for incremental community detection in dynamic networks. Phys. A Stat. Mech. Appl. 443, 70–85 (2016)
Shang, J., Liu, L., Xie, F., Chen, Z., Miao, J., Fang, X., Wu, C.: A real-time detecting algorithm for tracking community structure of dynamic networks. CoRR abs/1407.2683 (2014)
Xie, J., Chen, M., Szymanski, B.K.: Labelrankt: incremental community detection in dynamic networks via label propagation. CoRR abs/1305.2006 (2013)
Zhuang, D.: Modularity-based dynamic community detection. CoRR abs/1709. 08350 (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Agarwal, P., Verma, R., Agarwal, A., Chakraborty, T. (2018). DyPerm: Maximizing Permanence for Dynamic Community Detection. In: Phung, D., Tseng, V., Webb, G., Ho, B., Ganji, M., Rashidi, L. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2018. Lecture Notes in Computer Science(), vol 10937. Springer, Cham. https://doi.org/10.1007/978-3-319-93034-3_35
Download citation
DOI: https://doi.org/10.1007/978-3-319-93034-3_35
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-93033-6
Online ISBN: 978-3-319-93034-3
eBook Packages: Computer ScienceComputer Science (R0)