Abstract
Community detection is a fundamental problem in graph-based data analytics. Among many models, the distance dynamics model proposed recently is shown to be able to faithfully capture natural communities that are of different sizes. However, the state-of-the-art algorithm \(\mathsf {Attractor}\) for distance dynamics does not scale to graphs with large maximum vertex degrees, which is the case for large real graphs. In this paper, we aim to scale distance dynamics to large graphs. To achieve that, we propose a fast distance dynamics algorithm \(\mathsf {FDD}\). We show that \(\mathsf {FDD}\) has a worst-case time complexity of \( \mathcal{O}(T\cdot \gamma \cdot m)\), where T is the number of iterations until convergence, \(\gamma \) is a small constant, and m is the number of edges in the input graph. Thus, the time complexity of \(\mathsf {FDD}\) does not depend on the maximum vertex degree. Moreover, we also propose optimization techniques to alleviate the dependency on T. We conduct extensive empirical studies on large real graphs and demonstrate the efficiency and effectiveness of \(\mathsf {FDD}\).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Abboud, A., Williams, V.V.: Popular conjectures imply strong lower bounds for dynamic problems. In: Proceeding of FOCS 2014, pp. 434–443 (2014)
Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)
Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp. 2008(10), 10008 (2008)
Brandes, U., et al.: On Modularity-NP-Completeness and Beyond. Universität Fak. für Informatik, Bibliothek (2006)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms. MIT press, Cambridge (2009)
Donetti, L., Munoz, M.A.: Detecting network communities: a new systematic and efficient algorithm. J. Stat. Mech. Theory Exp. 2004(10), 10012 (2004)
Eriksen, K.A., Simonsen, I., Maslov, S., Sneppen, K.: Modularity and extreme edges of the internet. Phys. Rev. Lett. 90(14), 148701 (2003)
Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3–5), 75–174 (2010)
Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proc. Int. Acad. Sci. 99(12), 7821–7826 (2002)
Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291–307 (1970)
Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Phys. Rev. E: Stat., Nonlin, Soft Matter Phys. 78(4), 046110 (2008)
Newman, M.E.: Fast algorithm for detecting community structure in networks. Phys. Rev. E 69(6), 066133 (2004)
Newman, M.E., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004)
Palla, G., Derényi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814 (2005)
Ravasz, E., Barabási, A.L.: Hierarchical organization in complex networks. Phys. Rev. E 67(2), 026112 (2003)
Shao, J., Han, Z., Yang, Q., Zhou, T.: Community detection based on distance dynamics. In: Proceedings of SIGKDD 2015, pp. 1075–1084 (2015)
Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888–905 (2000)
Strehl, A., Ghosh, J., Mooney, R.: Impact of similarity measures on web-page clustering. In: Workshop on Artificial Intelligence for Web Search (AAAI 2000), vol. 58, p. 64 (2000)
Suaris, P.R., Kedem, G.: An algorithm for quadrisection and its application to standard cell placement. IEEE Trans. Circuits Syst. 35(3), 294–303 (1988)
Wilkinson, D.M., Huberman, B.A.: A method for finding communities of related genes. Proc. Nat. Acad. Sci. 101(1), 5241–5248 (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Alsahafy, M., Chang, L. (2020). Fast Algorithm for Distance Dynamics-Based Community Detection. In: Huang, Z., Beek, W., Wang, H., Zhou, R., Zhang, Y. (eds) Web Information Systems Engineering – WISE 2020. WISE 2020. Lecture Notes in Computer Science(), vol 12342. Springer, Cham. https://doi.org/10.1007/978-3-030-62005-9_16
Download citation
DOI: https://doi.org/10.1007/978-3-030-62005-9_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-62004-2
Online ISBN: 978-3-030-62005-9
eBook Packages: Computer ScienceComputer Science (R0)