[1] Barnes J A. Class and committees in a Norwegian Island parish [J]. Human Relations, 1954, 7(1): 39-58. [2] Centola D. The spread of behavior in an online social network experiment [J]. Science, 2010, 329(5996): 1194-1197. [3] Leskovec J, Adamic L A, Huberman B A. The dynamics of viral marketing [J]. ACM Transactions on the Web, 2007, 1(1): 5. [4] Song X D, Tseng B L, Lin C Y, et al. Personalized recommendation driven by information flow [C]//29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2006: 509-516. [5] Tajeuna E G, Bouguessa M, Wang S R. Modeling and predicting community structure changes in time-evolving social networks [J]. IEEE Transactions on Knowledge and Data Engineering, 2019, 31(6): 1166-1180. [6] Chen X Q, Zhou F, Zhang K P, et al. Information diffusion prediction via recurrent cascades convolution [C]//IEEE 35th International Conference on Data Engineering (ICDE), 2019: 770- 781. [7] He X N, Gao M, Kan M Y, et al. BiRank: towards ranking on bipartite graphs [J]. IEEE Transactions on Knowledge and Data Engineering, 2017, 29(1): 57-71. [8] Wang X, Nie L Q, Song X M, et al. Unifying virtual and physical worlds: learning toward local and global consistency [J]. ACM Transactions on Information Systems, 2018, 36(1): 1-26. [9] Blondel V D, Guillaume J L, Lambiotte R, et al. Fast unfolding of communities in large networks [J]. Journal of Statistical Mechanics: Theory and Experiment, 2008, 10: P10008. [10] Šubelj L. Label propagation for clustering [J]. Advances in Network Clustering and Blockmodeling, 2019: 121-150. [11] Girvan M, Newman M E J. Community structure in social and biological networks [J]. Proceedings of the National Academy of Sciences of the United States of America, 2002, 99(12): 7821-7826. [12] Xiao Q, Du S, Zhang K, et al. Adaptive sparse graph learning for multi-view spectral clustering [J]. Applied Intelligence, 2023, 53(12): 14855-14875. [13] Pan S, Hu R, Long G, et al. Adversarially regularized graph autoencoder for graph embedding [DB/OL]. (2018-02-13) [2025-08-05]. https://arxiv.org/abs/1802.04407. [14] Kipf T N, Welling M. Semi-supervised classification with graph convolutional networks [DB/OL]. (2016-09-09) [2025-08-05]. https://arxiv.org/abs/1609.02907. [15] Xie J, Girdhick R, Farhadi A. Unsupervised deep embedding for clustering analysis [C]//International Conference on Machine Learning, 2016: 478-487. [16] Airoldi E M, Blei D, Fienberg S, et al. Mixed membership stochastic blockmodels [J]. Journal of Machine Learning Research, 2008(9): 1981-2014. [17] Kipf T N, Welling M. Variational graph auto-encoders [DB/OL]. (2016-11-21) [2025-08-05]. https://arxiv.org/abs/1611.07308. [18] Bo D Y, Wang X, Shi C, et al. Structural deep clustering network [C]//Web Conference, 2020: 1400-1410. [19] Wang C, Pan S, Hu R, et al. Attributed graph clustering: a deep attentional embedding approach [DB/OL]. (2019-06-15) [2025-08-05]. https://arxiv.org/abs/1906.06532. [20] Wu Y L, Fu Y, Xu J W, et al. Heterogeneous question answering community detection based on graph neural network [J]. Information Sciences, 2023, 621: 652-671. [21] Costa A R, Ralha C G. AC2CD: an actor–critic architecture for community detection in dynamic social networks [J]. Knowledge-Based Systems, 2023, 261: 110202. [22] Stephan L, Zhu Y Z. Sparse random hypergraphs: non-backtracking spectra and community detection [J]. Information and Inference: A Journal of the IMA, 2024, 13(1): iaae004. [23] Yang X H, Liu Y, Zhou S H, et al. Cluster-guided contrastive graph clustering network [J]. AAAI Conference on Artificial Intelligence, 2023, 37(9): 10834-10842. [24] Reihanian A, Feizi-Derakhshi M R, Aghdasi H S. An enhanced multi-objective biogeography-based optimization for overlapping community detection in social networks with node attributes [J]. Information Sciences, 2023, 622: 903-929. [25] Liu Y, Yang X H, Zhou S H, et al. Simple contrastive graph clustering [J]. IEEE Transactions on Neural Networks and Learning Systems, 2024, 35(10): 13789-13800. [26] Hajiveiseh A, Seyedi S A, Tab F A. Deep asymmetric nonnegative matrix factorization for graph clustering [J]. Pattern Recognition, 2024, 148: 110179. [27] Li H J, Feng Y H, Xia C Y, et al. Overlapping graph clustering in attributed networks via generalized cluster potential game [J]. ACM Transactions on Knowledge Discovery from Data, 2024, 18(1): 1-26. [28] Berahmand K, Mohammadi M, Sheikhpour R, et al. WSNMF: weighted symmetric nonnegative matrix factorization for attributed graph clustering [J]. Neurocomputing, 2024, 566: 127041. [29] Peng X, Cheng J R, Tang X Y, et al. Dual contrastive learning network for graph clustering [J]. IEEE Transactions on Neural Networks and Learning Systems, 2024, 35(8): 10846-10856. [30] Mcpherson M, Smith-Lovin L, Cook J M. Birds of a feather: homophily in social networks [J]. Annual Review of Sociology, 2001, 27: 415-444. [31] Pirasteh P, Hwang D, Jung J J. Exploiting matrix factorization to asymmetric user similarities in recommendation systems [J]. Knowledge-Based Systems, 2015, 83: 51-57. [32] Student. The probable error of a mean [J]. Biometrika, 1908, 6(1): 1-25. [33] Kullbak S, Leibler R A. On information and sufficiency [J]. The Annals of Mathematical Statistics, 1951, 22(1): 79-86. [34] Peng Z H, Liu H, Jia Y H, et al. Attention-driven graph clustering network [C]//29th ACM International Conference on Multimedia, 2021: 935-943. [35] Tu W X, Zhou S H, Liu X W, et al. Deep fusion clustering network [J]. AAAI Conference on Artificial Intelligence, 2021, 35(11): 9978-9987. [36] Li X, Li D, Jin R M, et al. Deep graph clustering with random-walk based scalable learning [C]//IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), 2022: 88-95. [37] Fanseu K B, Zhang L, Ma K L, et al. GRACE: a general graph convolution framework for attributed graph clustering [J]. ACM Transactions on Knowledge Discovery from Data, 2023, 17(3): 1-31. |