Abstract
Community detection based on spectral clustering has been proved effective. However, spectral clustering is more challenging due to two significant issues: the construction of a good similarity matrix and the automatic detection of the number of clusters. In our previous paper, we developed a new similarity matrix for undirected networks based on Coulomb's law. It uses local and global measures to identify the communities efficiently using a label propagation algorithm. Thus, this paper extends our previous work to spectral clustering, and a novel community detection algorithm called SC_CL is proposed. Specifically, by exploiting the spectrum of the normalized Laplacian based on Coulomb's matrix, the graph's vertices are first embedded into a low-dimensional vector space, then k-means clustering is performed on the projected vertices. Experiments on synthetic benchmarks and real network datasets show that spectral clustering with this new similarity matrix achieves significant accuracy over existing methods. Moreover, the results provide clear and meaningful visualization of graph embedding in 2D space using dimensionality reduction.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Availability of data and materials
The datasets used and/or analyzed during the current study are available from the corresponding author on reasonable request.
References
Bedi P, Sharma C (2016) Community detection in social networks. Data Min Knowl Discov 6:21
Capocci A, Servedio VDP, Caldarelli G, Colaiori F (2005) Detecting communities in large networks. Phys Stat Mech Its Appl 352:669–676. https://doi.org/10.1016/j.physa.2004.12.050
Chaudhuri K, Chung F, Tsiatas A (2012) Spectral clustering of graphs with general degrees in the extended planted partition model. In: Proceedings of the 25th annual conference on learning theory. JMLR Workshop and Conference Proceedings, pp 35.1–35.23
Chauhan S, Girvan M, Ott E (2009) Spectral properties of networks with community structure. Phys Rev E 80:056114. https://doi.org/10.1103/PhysRevE.80.056114
Cheng X-Q, Shen H-W (2010) Uncovering the community structure associated with the diffusion dynamics on networks. J Stat Mech Theory Exp 2010:P04024. https://doi.org/10.1088/1742-5468/2010/04/P04024
Coscia M, Giannotti F, Pedreschi D (2011) A classification for community discovery methods in complex networks. Stat Anal Data Min 4:512–546. https://doi.org/10.1002/sam.10133
Donetti L, Muñoz MA (2004) Detecting network communities: a new systematic and efficient algorithm. J Stat Mech Theory Exp 2004:P10012. https://doi.org/10.1088/1742-5468/2004/10/P10012
Fanuel M, Alaíz CM, Suykens JAK (2017) Magnetic eigenmaps for community detection in directed networks. Phys Rev E 95:022302. https://doi.org/10.1103/PhysRevE.95.022302
Fortunato S, Barthelemy M (2007) Resolution limit in community detection. Proc Natl Acad Sci 104:36–41. https://doi.org/10.1073/pnas.0605965104
Friedman M (1940) A comparison of alternative tests of significance for the problem of m rankings. Ann Math Stat 11:86–92. https://doi.org/10.1214/aoms/1177731944
Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99:7821–7826. https://doi.org/10.1073/pnas.122653799
Grover A, Leskovec J (2016) node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining. ACM, San Francisco California USA, pp 855–864
He K, Sun Y, Bindel D, Hopcroft J, Li Y (2015) Detecting overlap** communities from local spectral subspaces. In: 2015 IEEE international conference on data mining. IEEE, Atlantic City, NJ, USA, pp 769–774
Hu F, Liu J, Li L, Liang J (2020) Community detection in complex networks using Node2vec with spectral clustering. Phys Stat Mech Its Appl 545:123633. https://doi.org/10.1016/j.physa.2019.123633
Jia H, Ding S, Xu X, Nie R (2014) The latest research progress on spectral clustering. Neural Comput Appl 24:1477–1486. https://doi.org/10.1007/s00521-013-1439-2
Joseph A, Yu B (2016) Impact of regularization on spectral clustering. Ann Stat. https://doi.org/10.1214/16-AOS1447
Krzakala F, Moore C, Mossel E, Neeman J, Sly A, Zdeborova L, Zhang P (2013) Spectral redemption in clustering sparse networks. Proc Natl Acad Sci 110:20935–20940. https://doi.org/10.1073/pnas.1312486110
Kuo C-T, Walker PB, Carmichael O, Davidson I (2014) Spectral clustering for medical imaging. IEEE Computer Society, pp 887–892
Laassem B, Idarrou A, Boujlaleb L, Iggane M (2022) Label propagation algorithm for community detection based on Coulomb’s law. Phys Stat Mech Its Appl 593:126881. https://doi.org/10.1016/j.physa.2022.126881
Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 5
Leicht EA, Newman MEJ (2008) Community structure in directed networks. Phys Rev Lett 100:118703. https://doi.org/10.1103/PhysRevLett.100.118703
Leskovec J, Krevl A (2014) SNAP datasets: stanford large network dataset collection
Li Y, He K, Bindel D, Hopcroft J (2015) Uncovering the small community structure in large networks: a local spectral approach. ar**v https://arxiv.org/abs/150907715 Phys
Lusseau D, Schneider K, Boisseau OJ, Haase P, Slooten E, Dawson SM (2003) The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations: Can geographic isolation explain this unique trait? Behav Ecol Sociobiol 54:396–405. https://doi.org/10.1007/s00265-003-0651-y
Mahoney MW, Orecchia L, Vishnoi NK (2012) A local spectral method for graphs: with applications to improving graph partitions and exploring data graphs locally. J Mach Learn Res 13:2339–2365
Newman MEJ (2003) The structure and function of complex networks. SIAM Rev 45:167–256. https://doi.org/10.1137/S003614450342480
Newman MEJ (2006a) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74:036104. https://doi.org/10.1103/PhysRevE.74.036104
Newman MEJ (2006b) Modularity and community structure in networks. Proc Natl Acad Sci 103:8577–8582. https://doi.org/10.1073/pnas.0601602103
Newman MEJ (2013) Spectral methods for network community detection and graph partitioning. Phys Rev E 88:042822. https://doi.org/10.1103/PhysRevE.88.042822
Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69:026113. https://doi.org/10.1103/PhysRevE.69.026113
Ng A, Jordan M, Weiss Y (2001) On spectral clustering: analysis and an algorithm. In: Dietterich T, Becker S, Ghahramani Z (eds) Advances in neural information processing systems. MIT Press
Hernandez V, Roman J, Tomas A, Vidal V (2009) A survey of software for sparse eigenvalue problems. Univ Politec Valencia SLEPs Tech Rep STR-6
Shen H-W, Cheng X-Q, Fang B-X (2010) Covariance, correlation matrix, and the multiscale community structure of networks. Phys Rev E 82:016114. https://doi.org/10.1103/PhysRevE.82.016114
Shen H-W, Cheng X-Q (2010) Spectral methods for the detection of network community structure: a comparative analysis. 14
Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans PATTERN Anal Mach Intell 22:18
Tang L, Liu H (2010) Community detection and mining in social media. Synth Lect Data Min Knowl Discov 2:50. https://doi.org/10.2200/S00298ED1V01Y201009DMK003
van der Maaten L, Hinton GE (2008) Visualizing data using t-SNE. J Mach Learn Res 9:2579–2605
von Luxburg U (2007) A tutorial on spectral clustering. Stat Comput 17:395–416. https://doi.org/10.1007/s11222-007-9033-z
Wahl S, Sheppard J (2015) Hierarchical fuzzy spectral clustering in social networks using spectral characterization. In: The twenty-eighth international flairs conference
**e F, Ji M, Zhang Y, Huang D (2009) The detection of community structure in network via an improved spectral method. Phys Stat Mech Its Appl 388:3268–3272. https://doi.org/10.1016/j.physa.2009.04.036
Xu Y (2020) A spectral method to detect community structure based on the communicability modularity. Phys Stat Mech Its Appl 537:122751. https://doi.org/10.1016/j.physa.2019.122751
Xu Y, Zhuang Z, Li W, Zhou X (2018) Effective community division based on improved spectral clustering. Neurocomputing 279:54–62. https://doi.org/10.1016/j.neucom.2017.06.085
Yang J-X, Zhang X-D (2017) A spectral method to detect community structure based on distance modularity matrix. Int J Mod Phys B 31:1750129. https://doi.org/10.1142/S0217979217501296
Yang Z, Algesheimer R, Tessone CJ (2016) A comparative analysis of community detection algorithms on artificial networks. Sci Rep 6:30750. https://doi.org/10.1038/srep30750
Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33:452–473
Zhang X, You Q (2011) An improved spectral clustering algorithm based on random walk. Front Comput Sci China 5:268–278. https://doi.org/10.1007/s11704-011-0023-0
Funding
This research received no specific grant from any funding agency in the public, commercial, or not-for-profit sectors.
Author information
Authors and Affiliations
Contributions
LB, IA, IM contributed to the design and implementation of the research, to the analysis of the results, and to the writing—reviewing and editing of the manuscript. BL contributed to reviewing and editing.
Corresponding author
Ethics declarations
Competing interests
The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Laassem, B., Idarrou, A., Boujlaleb, L. et al. A spectral method to detect community structure based on Coulomb’s matrix. Soc. Netw. Anal. Min. 13, 3 (2023). https://doi.org/10.1007/s13278-022-01010-7
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s13278-022-01010-7