Abstract
Community detection is designed to divide a network into multiple subnetworks (communities) with high cohesiveness, which has attracted wide attention in graph analysis. Attributes are typically served as auxiliary side information to improve the quality of community detection. In spite of their effectiveness, they suffer from two limitations: (1) existing methods usually return a single partition of the network by default, which is a critical requirement and not allowing much flexibility; (2) existing approach just globally assigns the same attribute weights to each community. We believe that community detection should be approached from the perspective of attribute subspace with different dimensional correlations. Toward this end, a novel attribute subspace-guided multi-scale community detection method (ASMS) is proposed, which can identify multi-scale communities with personalized subspaces. Specifically, ASMS can output multiple network divisions of different scales, and each subdivision has a distinctive attribute subspace that is used to reveal the inner meaning of that community formation. In particular, we devise three operators to infer the attribute subspaces. Abundant experimental results indicate that ASMS outperforms the existing methods.
Similar content being viewed by others
Data availability
The datasets used and/or analyzed during the current study are available from the corresponding author on reasonable request.
References
Almeida-Silva F, Venancio TM (2022) Bionero: an all-in-one r/bioconductor package for comprehensive and easy biological network reconstruction. Funct Integr Genom 22(1):131–136
Li H, Zhang X, Khaliq U, Rehman FU (2023) Emergency engineering reconstruction mode based on the perspective of professional donations. Front Psychol 14:971552
Li Q, Ma H, Li J, Li Z, Jiang Y (2022) Searching target communities with outliers in attributed graph. Knowl-Based Syst 235:107622
Liu H, Ma H, Li Z, Chang L (2023) Adaptive target community search with sample expansion. Knowl-Based Syst 259:110077
Li Q, Ma H, Li Z, Chang L (2023) Multiresolution local spectral attributed community search. ACM Trans Web 18(1):1–28
Yang F, Ma H, Yan C, Li Z, Chang L (2023) Polarized communities search via co-guided random walk in attributed signed networks. ACM Trans Internet Technol 23(4):1–22
Fortunato S (2010) Community detection in graphs. Phys Rep 486(3–5):75–174
Maekawa S, Takeuch K, Onizuka M (2018) Non-linear attributed graph clustering by symmetric NMF with PU learning, arXiv preprint arXiv:1810.00946
Zhe C, Sun A, Xiao X (2019) Community detection on large complex attribute network. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining, pp. 2041–2049
Zhao Q, Ma H, Li X, Li Z (2021) Is the simple assignment enough? exploring the interpretability for community detection. Int J Mach Learn Cybern 12(12):3463–3474
Li T, Lei L, Bhattacharyya S, Van den Berge K, Sarkar P, Bickel PJ, Levina E (2022) Hierarchical community detection by recursive partitioning. J Am Stat Assoc 117(538):951–968
Zhao H, Yang X, Wang Z, Yang E, Deng C (2021) Graph debiased contrastive learning with joint representation clustering. In: IJCAI, pp. 3434–3440
Ren S, Zhang S, Wu T (2020) An improved spectral clustering community detection algorithm based on probability matrix. Discret Dyn Nat Soc 2020:1–6
Hu F, Liu J, Li L, Liang J (2020) Community detection in complex networks using node2vec with spectral clustering. Phys A 545:123633
Agrawal S, Patel A (2021) Sag cluster: an unsupervised graph clustering based on collaborative similarity for community detection in complex networks. Physica A 563:125459
Ma H, Liu Z, Zhang X, Zhang L, Jiang H (2021) Balancing topology structure and node attribute in evolutionary multi-objective community detection for attributed networks. Knowl-Based Syst 227:107169
Chen H, Yu Z, Yang Q, Shao J (2022) Community detection in subspace of attribute. Inf Sci 602:220–235
Hammond DK, Vandergheynst P, Gribonval R (2011) Wavelets on graphs via spectral graph theory. Appl Comput Harmon Anal 30(2):129–150
Öztemiz F, Karcı A (2023) Ko: modularity optimization in community detection. Neural Comput Appl 35(15):11073–11087
Zhu J, Chen B, Zeng Y (2020) Community detection based on modularity and k-plexes. Inf Sci 513:127–142
Yan C, Ma H, Li Q, Yang F, Li Z (2023) Efficient multi-scale community search method based on spectral graph wavelet. Front Comp Sci 17(5):175335
Fortunato S, Barthelemy M (2007) Resolution limit in community detection. Proc Natl Acad Sci 104(1):36–41
Leskovec J, Mcauley J (2012) Learning to discover social circles in ego networks, Advances in neural information processing systems 25
Peng Z, Luo M, Li J, Liu H, Zheng Q et al (2018) Anomalous: a joint modeling approach for anomaly detection on attributed networks. In: IJCAI, pp. 3513–3519
Günnemann S, Färber I, Raubach S, Seidl T (2013) Spectral subspace clustering for graphs with feature vectors. In: 2013 IEEE 13th international conference on data mining, IEEE, pp. 231–240
Ali S, Shakeel MH, Khan I, Faizullah S, Khan MA (2021) Predicting attributes of nodes using network structure. ACM Trans Intell Syst Technol 12(2):1–23
Sales-Pardo M, Guimera R, Moreira AA, Amaral LAN (2007) Extracting the hierarchical organization of complex systems. Proc Natl Acad Sci 104(39):15224–15229
Ruan Y, Fuhry D, Parthasarathy S (2013) Efficient community detection in large networks using content and links. In: Proceedings of the 22nd international conference on World Wide Web, pp. 1089–1098
Cavallari S, Zheng VW, Cai H, Chang KC-C, Cambria E (2017) Learning community embedding with community detection and node embedding on graphs. In: Proceedings of the 2017 ACM on conference on information and knowledge management, pp. 377–386
Acknowledgements
This work is supported by the Industrial Support Project of Gansu Colleges (2022CYZC-11), National Natural Science Foundation of China (62276073, 61762078), Gansu Natural Science Foundation Project (21JR7RA114) and NWNU Teachers Research Capacity Promotion Plan (NWNU-LKQN2019-2).
Author information
Authors and Affiliations
Contributions
Cairui Yan contributed to conceptualization, methodology, software, formal analysis, investigation, data curation, writing—original draft, writing—review and editing, visualization, project administration, funding acquisition. Huifang Ma contributed to conceptualization, methodology, software, investigation, resources, data curation, writing—original draft, writing—review and editing, visualization, supervision, project administration, funding acquisition. Yuechen Tang contributed to conceptualization, software, investigation, data curation, writing—review and editing. Zhixin Li contributed to conceptualization, validation, writing—original draft, writing—review and editing, visualization, supervision, funding acquisition.
Corresponding author
Ethics declarations
Conflict of interest
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.
Ethical and informed consent for data used
Written informed consent for publication of this paper was obtained from all authors.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix
Appendix
In Eq. (11), the minimization of H(w) is a constrained nonlinear optimization problem for which the solution is uncertain. For this we introduce the Lagrange multiplication to generate an unconstrained minimization problem as shown in Eq. (19).
where \(\delta \) is containing the Lagrange multiplier corresponding to the constraint. Set the gradient of \({{H}^{\prime }}(\textbf{w},\delta )\) with regard to \({{w}_{t}}\) and \(\delta \) to 0, Eqs. (20) and (21) can be obtained as follows:
Let \({{D}_{t}}=\sum \nolimits _{i=1}^{C}{\sum \nolimits _{j=i+1}^{C}{{{\left( {{f}_{{{v}_{i}}t}}-{{f}_{{{v}_{j}}t}} \right) }^{2}}}}\text { }\), so:
According to Eq. (21), \(\sum \nolimits _{t=1}^{F}{{{w}_{t}}}=1\), thus we have:
By Eq. (23), we have \(\exp \left( \frac{\delta -\gamma }{\gamma } \right) ={1}/{\sum \nolimits _{t=1}^{F}{\exp }\left( \frac{-{{D}_{t}}}{\gamma } \right) }\;\). Substituting the above results back into Eqs. (22), (24) can be obtained:
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
Yan, C., Ma, H., Tang, Y. et al. Attribute subspace-guided multi-scale community detection. Neural Comput & Applic (2024). https://doi.org/10.1007/s00521-024-09751-6
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00521-024-09751-6