{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T04:58:51Z","timestamp":1781326731481,"version":"3.54.1"},"reference-count":110,"publisher":"Association for Computing Machinery (ACM)","issue":"6","funder":[{"name":"Hong Kong RGC ECS grant","award":["22202623"],"award-info":[{"award-number":["22202623"]}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["62302414"],"award-info":[{"award-number":["62302414"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Huawei gift fund"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2025,12,4]]},"abstract":"<jats:p>\n                    Multi-relational graphs (MRGs) are an expressive data structure for modeling diverse interactions\/relations among real objects (i.e., nodes), which pervade extensive applications and scenarios. Given an MRG\n                    <jats:italic toggle=\"yes\">G<\/jats:italic>\n                    with\n                    <jats:italic toggle=\"yes\">N<\/jats:italic>\n                    nodes, partitioning the node set therein into\n                    <jats:italic toggle=\"yes\">K<\/jats:italic>\n                    disjoint clusters (referred to as MRGC) is a fundamental task in analyzing MRGs, which has garnered considerable attention. However, the majority of existing solutions towards MRGC either yield severely compromised result quality by ineffective fusion of heterogeneous graph structures and attributes, or struggle to cope with sizable MRGs with millions of nodes and billions of edges due to the adoption of sophisticated and costly deep learning models.\n                  <\/jats:p>\n                  <jats:p>\n                    In this paper, we present DEMM and DEMM+, two effective MRGC approaches to address the aforementioned limitations. Specifically, our algorithms are built on novel two-stage optimization objectives, where the former seeks to derive high-caliber node feature vectors by optimizing the\n                    <jats:italic toggle=\"yes\">multi-relational Dirichlet energy<\/jats:italic>\n                    specialized for MRGs, while the latter minimizes the\n                    <jats:italic toggle=\"yes\">Dirichlet energy<\/jats:italic>\n                    of clustering results over the node affinity graph. In particular, DEMM+ achieves significantly higher scalability and efficiency over our based method DEMM through a suite of well-thought-out optimizations. Key technical contributions include (i) a highly efficient approximation solver for constructing node feature vectors, and (ii) a judicious and theoretically-grounded problem transformation together with carefully-crafted techniques that enable the linear-time clustering without explicitly materializing the N x N dense affinity matrix. Further, we extend DEMM to handle attribute-less MRGs through non-trivial adaptations. Extensive experiments, comparing DEMM+ against 20 baselines over 11 real MRGs, exhibit that DEMM+ is consistently superior in terms of clustering quality measured against ground-truth labels, while often being remarkably faster.\n                  <\/jats:p>","DOI":"10.1145\/3769784","type":"journal-article","created":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:32:13Z","timestamp":1764995533000},"page":"1-28","source":"Crossref","is-referenced-by-count":1,"title":["Effective Clustering for Large Multi-Relational Graphs"],"prefix":"10.1145","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-2970-5161","authenticated-orcid":false,"given":"Xiaoyang","family":"Lin","sequence":"first","affiliation":[{"name":"Hong Kong Baptist University, Hong Kong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-4841-9175","authenticated-orcid":false,"given":"Runhao","family":"Jiang","sequence":"additional","affiliation":[{"name":"Hong Kong Baptist University, Hong Kong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7284-3096","authenticated-orcid":false,"given":"Renchi","family":"Yang","sequence":"additional","affiliation":[{"name":"Hong Kong Baptist University, Hong Kong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,12,5]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3008732"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2024.111813"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btz718"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/RBME.2021.3122522"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.26599\/BDMA.2024.9020013"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2025.130063"},{"issue":"1","key":"e_1_2_1_7_1","first-page":"37","article-title":"collaborator recommendation based on attributed network embedding","volume":"7","author":"Du O.","year":"2022","unstructured":"O. Du and Y. Li, ''Academic collaborator recommendation based on attributed network embedding.'' J. Data Inf. Sci., vol. 7, no. 1, pp. 37-56, 2022.","journal-title":"J. Data Inf. Sci."},{"key":"e_1_2_1_8_1","first-page":"0","article-title":"Recommendation in academia: A joint multi-relational model","author":"Yang Z.","year":"2014","unstructured":"Z. Yang, D. Yin, and B. D. Davison, ''Recommendation in academia: A joint multi-relational model,'' in ASONAM 2014. hskip 1em plus 0.5em minus 0.4emrelax IEEE, 2014, pp. 566-571.","journal-title":"ASONAM"},{"key":"e_1_2_1_9_1","first-page":"291","article-title":"Community detection in multi-relational social networks based on relational concept analysis","volume":"159","author":"Guesmi S.","year":"2019","unstructured":"S. Guesmi, C. Trabelsi, and C. Latiri, ''Community detection in multi-relational social networks based on relational concept analysis,'' PCS, vol. 159, pp. 291-300, 2019.","journal-title":"PCS"},{"key":"e_1_2_1_10_1","first-page":"1038","article-title":"graph based heterogeneous multi-task learning in community question answering","author":"Lin Z.","year":"2021","unstructured":"Z. Lin, H. Ke, N.-Y. Wong, J. Bai, Y. Song, H. Zhao, and J. Ye, ''Multi-relational graph based heterogeneous multi-task learning in community question answering,'' in CIKM, 2021, pp. 1038-1047.","journal-title":"CIKM"},{"key":"e_1_2_1_11_1","first-page":"1","article-title":"Community detection via heterogeneous interaction analysis","author":"Tang L.","year":"2012","unstructured":"L. Tang, X. Wang, and H. Liu, ''Community detection via heterogeneous interaction analysis,'' DMKD, pp. 1-33, 2012.","journal-title":"DMKD"},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","first-page":"e0215520","DOI":"10.1371\/journal.pone.0215520","article-title":"Multi-scale detection of hierarchical community architecture in structural and functional brain networks","author":"Ashourvan A.","year":"2019","unstructured":"A. Ashourvan, Q. K. Telesford, T. Verstynen, J. M. Vettel, and D. S. Bassett, ''Multi-scale detection of hierarchical community architecture in structural and functional brain networks,'' Plos one, p. e0215520, 2019.","journal-title":"Plos one"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-022-19994-9"},{"key":"e_1_2_1_14_1","first-page":"3675","article-title":"Effective and scalable clustering on massive attributed graphs","author":"Yang R.","year":"2021","unstructured":"R. Yang, J. Shi, Y. Yang, K. Huang, S. Zhang, and X. Xiao, ''Effective and scalable clustering on massive attributed graphs,'' in TheWebConf, 2021, pp. 3675-3687.","journal-title":"TheWebConf"},{"key":"e_1_2_1_15_1","volume-title":"A survey of deep graph clustering: Taxonomy, challenge, application, and open resource,'' arXiv preprint arXiv:2211.12875","author":"Liu Y.","year":"2022","unstructured":"Y. Liu, J. Xia, S. Zhou, X. Yang, K. Liang, C. Fan, Y. Zhuang, S. Z. Li, X. Liu, and K. He, ''A survey of deep graph clustering: Taxonomy, challenge, application, and open resource,'' arXiv preprint arXiv:2211.12875, 2022."},{"key":"e_1_2_1_16_1","volume-title":"Contrastive multi-view representation learning on graphs,'' in ICML","author":"Hassani K.","year":"2020","unstructured":"K. Hassani and A. H. K. Ahmadi, ''Contrastive multi-view representation learning on graphs,'' in ICML, 2020."},{"key":"e_1_2_1_17_1","volume-title":"Graph filter-based multi-view attributed graph clustering,'' in IJCAI","author":"Lin Z.","year":"2021","unstructured":"Z. Lin and Z. Kang, ''Graph filter-based multi-view attributed graph clustering,'' in IJCAI, 2021."},{"key":"e_1_2_1_18_1","volume-title":"Multi-view contrastive graph clustering,'' in NIPS","author":"Pan E.","year":"2021","unstructured":"E. Pan and Z. Kang, ''Multi-view contrastive graph clustering,'' in NIPS, 2021."},{"key":"e_1_2_1_19_1","volume-title":"Self-weighted multiview clustering with multiple graphs,'' in IJCAI","author":"Nie F.","year":"2017","unstructured":"F. Nie, J. Li, and X. Li, ''Self-weighted multiview clustering with multiple graphs,'' in IJCAI, 2017."},{"key":"e_1_2_1_20_1","volume-title":"Dual label-guided graph refinement for multi-view graph clustering,'' in AAAI","author":"Ling Y.","year":"2023","unstructured":"Y. Ling, J. Chen, Y. Ren, X. Pu, J. Xu, X. Zhu, and L. He, ''Dual label-guided graph refinement for multi-view graph clustering,'' in AAAI, 2023."},{"key":"e_1_2_1_21_1","volume-title":"Unsupervised attributed multiplex network embedding,'' in AAAI","author":"Park C.","year":"2019","unstructured":"C. Park, D. Kim, J. Han, and H. Yu, ''Unsupervised attributed multiplex network embedding,'' in AAAI, 2019."},{"key":"e_1_2_1_22_1","first-page":"14021","article-title":"graph contrastive clustering network","volume":"2112","author":"Liu L.","year":"2021","unstructured":"L. Liu, Z. Kang, L. Tian, W. Xu, and X. He, ''Multilayer graph contrastive clustering network,'' ArXiv, vol. abs\/2112.14021, 2021.","journal-title":"ArXiv"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2021.10.006"},{"key":"e_1_2_1_24_1","volume-title":"Beyond homophily: Reconstructing structure for graph-agnostic clustering,'' in ICML","author":"Pan E.","year":"2023","unstructured":"E. Pan and Z. Kang, ''Beyond homophily: Reconstructing structure for graph-agnostic clustering,'' in ICML, 2023."},{"key":"e_1_2_1_25_1","first-page":"17386","article-title":"Beyond redundancy: Information-aware unsupervised multiplex graph structure learning","volume":"2409","author":"Shen Z.","year":"2024","unstructured":"Z. Shen, S. Wang, and Z. Kang, ''Beyond redundancy: Information-aware unsupervised multiplex graph structure learning,'' ArXiv, vol. abs\/2409.17386, 2024.","journal-title":"ArXiv"},{"key":"e_1_2_1_26_1","first-page":"14066","article-title":"Upper bounding barlow twins: A novel filter for multi-relational clustering","volume":"2312","author":"Qian X.","year":"2023","unstructured":"X. Qian, B. Li, and Z. Kang, ''Upper bounding barlow twins: A novel filter for multi-relational clustering,'' ArXiv, vol. abs\/2312.14066, 2023.","journal-title":"ArXiv"},{"key":"e_1_2_1_27_1","volume-title":"Disentangled multiplex graph representation learning,'' in International Conference on Machine Learning","author":"Mo Y.","year":"2023","unstructured":"Y. Mo, Y. Lei, J. Shen, X. Shi, H. T. Shen, and X. Zhu, ''Disentangled multiplex graph representation learning,'' in International Conference on Machine Learning, 2023."},{"key":"e_1_2_1_28_1","first-page":"16863","article-title":"Balanced multi-relational graph clustering","volume":"2407","author":"Shen Z.","year":"2024","unstructured":"Z. Shen, H. He, and Z. Kang, ''Balanced multi-relational graph clustering,'' ArXiv, vol. abs\/2407.16863, 2024.","journal-title":"ArXiv"},{"key":"e_1_2_1_29_1","volume-title":"Unsupervised multiplex graph learning with complementary and consistent information,'' MM","author":"Peng L.","year":"2023","unstructured":"L. Peng, X. Wang, and X. Zhu, ''Unsupervised multiplex graph learning with complementary and consistent information,'' MM, 2023."},{"key":"e_1_2_1_30_1","volume-title":"Enhancing multi-view graph neural network with cross-view confluent message passing,'' in MM","author":"Zhuang S.","year":"2024","unstructured":"S. Zhuang, S. Huang, W. Huang, Y. Chen, Z. Wu, and X. Liu, ''Enhancing multi-view graph neural network with cross-view confluent message passing,'' in MM, 2024."},{"key":"e_1_2_1_31_1","first-page":"361","volume-title":"Regularization on discrete spaces,'' in Joint Pattern Recognition Symposium. hskip 1em plus 0.5em minus 0.4emrelax Springer","author":"Zhou D.","year":"2005","unstructured":"D. Zhou and B. Sch\u00f6lkopf, ''Regularization on discrete spaces,'' in Joint Pattern Recognition Symposium. hskip 1em plus 0.5em minus 0.4emrelax Springer, 2005, pp. 361-368."},{"key":"e_1_2_1_32_1","volume-title":"Random features for large-scale kernel machines,'' Advances in neural information processing systems","author":"Rahimi A.","year":"2007","unstructured":"A. Rahimi and B. Recht, ''Random features for large-scale kernel machines,'' Advances in neural information processing systems, vol. 20, 2007."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1967.21.343"},{"key":"e_1_2_1_34_1","volume-title":"Kernel methods for pattern analysis. hskip 1em plus 0.5em minus 0.4emrelax Cambridge university press","author":"Shawe-Taylor J.","year":"2004","unstructured":"J. Shawe-Taylor and N. Cristianini, Kernel methods for pattern analysis. hskip 1em plus 0.5em minus 0.4emrelax Cambridge university press, 2004."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3769784"},{"key":"e_1_2_1_37_1","first-page":"444","article-title":"Polynomial algorithm for the k-cut problem","author":"Goldschmidt O.","year":"1988","unstructured":"O. Goldschmidt and D. S. Hochbaum, ''Polynomial algorithm for the k-cut problem,'' in FOCS, 1988, pp. 444-451.","journal-title":"FOCS"},{"key":"e_1_2_1_38_1","first-page":"744","volume-title":"MFCS'93 Gda'nsk, Poland, August 30-September 3","author":"Wagner D.","year":"1993","unstructured":"D. Wagner and F. Wagner, ''Between min cut and graph bisection,'' in Mathematical Foundations of Computer Science 1993: 18th International Symposium, MFCS'93 Gda'nsk, Poland, August 30-September 3, 1993 Proceedings 18. hskip 1em plus 0.5em minus 0.4emrelax Springer, 1993, pp. 744-750."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.35.11.652"},{"issue":"1","key":"e_1_2_1_41_1","first-page":"1","article-title":"Efficient high-quality clustering for large bipartite graphs","volume":"2","author":"Yang R.","year":"2024","unstructured":"R. Yang and J. Shi, ''Efficient high-quality clustering for large bipartite graphs,'' SIGMOD, vol. 2, no. 1, pp. 1-27, 2024.","journal-title":"SIGMOD"},{"key":"e_1_2_1_42_1","first-page":"313","article-title":"Multiclass spectral clustering","author":"Yu S. X.","year":"2003","unstructured":"S. X. Yu and J. Shi, ''Multiclass spectral clustering,'' in ICCV, 2003, pp. 313-319.","journal-title":"in"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i8.26188"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479895281484"},{"key":"e_1_2_1_45_1","volume-title":"Matrix analysis. hskip 1em plus 0.5em minus 0.4emrelax Cambridge university press","author":"Horn R. A.","year":"2012","unstructured":"R. A. Horn and C. R. Johnson, Matrix analysis. hskip 1em plus 0.5em minus 0.4emrelax Cambridge university press, 2012."},{"key":"e_1_2_1_46_1","volume-title":"Markov chains and mixing times. hskip 1em plus 0.5em minus 0.4emrelax American Mathematical Soc","author":"Levin D. A.","year":"2017","unstructured":"D. A. Levin and Y. Peres, Markov chains and mixing times. hskip 1em plus 0.5em minus 0.4emrelax American Mathematical Soc., 2017, vol. 107."},{"key":"e_1_2_1_47_1","first-page":"1366","volume-title":"Network schema preserving heterogeneous information network embedding.'' in IJCAI","author":"Zhao J.","year":"2020","unstructured":"J. Zhao, X. Wang, C. Shi, Z. Liu, and Y. Ye, ''Network schema preserving heterogeneous information network embedding.'' in IJCAI, 2020, pp. 1366-1372, scheduled for July 2020, Yokohama, Japan, postponed due to the Corona pandemic."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2982898"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3019134"},{"key":"e_1_2_1_50_1","volume-title":"Kernel adaptive filtering: a comprehensive introduction. hskip 1em plus 0.5em minus 0.4emrelax John Wiley & Sons","author":"Liu W.","year":"2011","unstructured":"W. Liu, J. C. Principe, and S. Haykin, Kernel adaptive filtering: a comprehensive introduction. hskip 1em plus 0.5em minus 0.4emrelax John Wiley & Sons, 2011."},{"key":"e_1_2_1_51_1","volume-title":"Orthogonal random features,'' Advances in neural information processing systems","author":"Yu F. X. X.","year":"2016","unstructured":"F. X. X. Yu, A. T. Suresh, K. M. Choromanski, D. N. Holtmann-Rice, and S. Kumar, ''Orthogonal random features,'' Advances in neural information processing systems, vol. 29, 2016."},{"key":"e_1_2_1_52_1","volume-title":"One2multi graph autoencoder for multi-view graph clustering,'' WWW","author":"Fan S.","year":"2020","unstructured":"S. Fan, X. Wang, C. Shi, E. Lu, K. Lin, and B. Wang, ''One2multi graph autoencoder for multi-view graph clustering,'' WWW, 2020."},{"key":"e_1_2_1_53_1","volume-title":"Magnn: Metapath aggregated graph neural network for heterogeneous graph embedding,'' WWW","author":"Fu X.","year":"2020","unstructured":"X. Fu, J. Zhang, Z. Meng, and I. King, ''Magnn: Metapath aggregated graph neural network for heterogeneous graph embedding,'' WWW, 2020."},{"key":"e_1_2_1_54_1","first-page":"00687","article-title":"Open graph benchmark: Datasets for machine learning on graphs","volume":"2005","author":"Hu W.","year":"2020","unstructured":"W. Hu, M. Fey, M. Zitnik, Y. Dong, H. Ren, B. Liu, M. Catasta, and J. Leskovec, ''Open graph benchmark: Datasets for machine learning on graphs,'' ArXiv, vol. abs\/2005.00687, 2020.","journal-title":"ArXiv"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330785"},{"key":"e_1_2_1_56_1","article-title":"neighborhood selection guided multi-relational graph neural networks","author":"Peng H.","year":"2021","unstructured":"H. Peng, R. Zhang, Y. Dou, R. Yang, J. Zhang, and P. S. Yu, ''Reinforced neighborhood selection guided multi-relational graph neural networks,'' ACM Trans. Inf. Syst., Dec. 2021.","journal-title":"ACM Trans. Inf. Syst."},{"key":"e_1_2_1_57_1","volume-title":"Heterogeneous graph attention network,'' The World Wide Web Conference","author":"Wang X.","year":"2019","unstructured":"X. Wang, H. Ji, C. Shi, B. Wang, P. Cui, P. S. Yu, and Y. Ye, ''Heterogeneous graph attention network,'' The World Wide Web Conference, 2019."},{"key":"e_1_2_1_58_1","first-page":"21","volume-title":"Dink-net: Neural clustering on large graphs,'' in International Conference on Machine Learning. hskip 1em plus 0.5em minus 0.4emrelax PMLR","author":"Liu Y.","year":"2023","unstructured":"Y. Liu, K. Liang, J. Xia, S. Zhou, X. Yang, X. Liu, and S. Z. Li, ''Dink-net: Neural clustering on large graphs,'' in International Conference on Machine Learning. hskip 1em plus 0.5em minus 0.4emrelax PMLR, 2023, pp. 21,794-21,812."},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiomed.2022.106127"},{"key":"e_1_2_1_60_1","first-page":"12","article-title":"Multiplex graph representation learning via dual correlation reduction","volume":"35","author":"Mo Y.","year":"2023","unstructured":"Y. Mo, Y. Chen, Y. Lei, L. Peng, X. Shi, C. Yuan, and X. Zhu, ''Multiplex graph representation learning via dual correlation reduction,'' TKDE, vol. 35, pp. 12,814-12,827, 2023.","journal-title":"TKDE"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5867"},{"issue":"127","key":"e_1_2_1_62_1","first-page":"1","article-title":"Graph clustering with graph neural networks","volume":"24","author":"Tsitsulin A.","year":"2023","unstructured":"A. Tsitsulin, J. Palowitch, B. Perozzi, and E. M\u00fcller, ''Graph clustering with graph neural networks,'' Journal of Machine Learning Research, vol. 24, no. 127, pp. 1-21, 2023.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_1_63_1","first-page":"3248","article-title":"S3gc: scalable self-supervised graph clustering","volume":"35","author":"Devvrit F.","year":"2022","unstructured":"F. Devvrit, A. Sinha, I. Dhillon, and P. Jain, ''S3gc: scalable self-supervised graph clustering,'' NeurIPS, vol. 35, pp. 3248-3261, 2022.","journal-title":"NeurIPS"},{"key":"e_1_2_1_64_1","first-page":"789","article-title":"subspace clustering for attributed graphs","author":"Lin X.","year":"2025","unstructured":"X. Lin, R. Yang, H. Zheng, and X. Ke, ''Spectral subspace clustering for attributed graphs,'' in KDD, 2025, pp. 789-799.","journal-title":"KDD"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.036104"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_2_1_69_1","first-page":"701","article-title":"Deepwalk: Online learning of social representations","author":"Perozzi B.","year":"2014","unstructured":"B. Perozzi, R. Al-Rfou, and S. Skiena, ''Deepwalk: Online learning of social representations,'' in KDD, 2014, pp. 701-710.","journal-title":"KDD"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i10.28983"},{"key":"e_1_2_1_71_1","first-page":"21","article-title":"Efficient deep embedded subspace clustering","author":"Cai J.","year":"2022","unstructured":"J. Cai, J. Fan, W. Guo, S. Wang, Y. Zhang, and Z. Zhang, ''Efficient deep embedded subspace clustering,'' CVPR, pp. 21-30, 2022.","journal-title":"CVPR"},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1017\/nws.2015.9"},{"key":"e_1_2_1_73_1","first-page":"1168","article-title":"re-evaluation of deep learning methods for attributed graph clustering","author":"Lai X.","year":"2023","unstructured":"X. Lai, D. Wu, C. S. Jensen, and K. Lu, ''A re-evaluation of deep learning methods for attributed graph clustering,'' in CIKM, 2023, pp. 1168-1177.","journal-title":"CIKM"},{"key":"e_1_2_1_74_1","first-page":"1","article-title":"A versatile framework for attributed network clustering via k-nearest neighbor augmentation","author":"Li Y.","year":"2024","unstructured":"Y. Li, G. Guo, J. Shi, R. Yang, S. Shen, Q. Li, and J. Luo, ''A versatile framework for attributed network clustering via k-nearest neighbor augmentation,'' VLDBJ, pp. 1-31, 2024.","journal-title":"VLDBJ"},{"key":"e_1_2_1_75_1","first-page":"1353","article-title":"Diffusion-based graph-agnostic clustering","author":"Xie K.","year":"2025","unstructured":"K. Xie, R. Yang, and S. Wang, ''Diffusion-based graph-agnostic clustering,'' in TheWebConf, 2025, pp. 1353-1364.","journal-title":"TheWebConf"},{"key":"e_1_2_1_76_1","first-page":"3782","article-title":"Effective clustering on large attributed bipartite graphs","author":"Yang R.","year":"2024","unstructured":"R. Yang, Y. Wu, X. Lin, Q. Wang, T. N. Chan, and J. Shi, ''Effective clustering on large attributed bipartite graphs,'' in KDD, 2024, pp. 3782-3793.","journal-title":"KDD"},{"issue":"2","key":"e_1_2_1_77_1","first-page":"1","article-title":"Efficient and effective attributed hypergraph clustering via k-nearest neighbor augmentation","volume":"1","author":"Li Y.","year":"2023","unstructured":"Y. Li, R. Yang, and J. Shi, ''Efficient and effective attributed hypergraph clustering via k-nearest neighbor augmentation,'' SIGMOD, vol. 1, no. 2, pp. 1-23, 2023.","journal-title":"SIGMOD"},{"key":"e_1_2_1_78_1","first-page":"2052","volume-title":"Adaptive local clustering over attributed graphs,'' in ICDE. hskip 1em plus 0.5em minus 0.4emrelax IEEE Computer Society","author":"Zheng H.","year":"2025","unstructured":"H. Zheng, R. Yang, and J. Xu, ''Adaptive local clustering over attributed graphs,'' in ICDE. hskip 1em plus 0.5em minus 0.4emrelax IEEE Computer Society, 2025, pp. 2052-2065."},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1145\/3110025.3110092"},{"key":"e_1_2_1_80_1","volume-title":"I-louvain: An attributed graph clustering method,'' in International Symposium on Intelligent Data Analysis","author":"Combe D.","year":"2015","unstructured":"D. Combe, C. Largeron, M. G\u00e9ry, and E. Egyed-Zsigmond, ''I-louvain: An attributed graph clustering method,'' in International Symposium on Intelligent Data Analysis, 2015."},{"key":"e_1_2_1_81_1","volume-title":"Community detection in attributed graphs: An embedding approach,'' in AAAI","author":"Li Y.","year":"2018","unstructured":"Y. Li, C. Sha, X. Huang, and Y. Zhang, ''Community detection in attributed graphs: An embedding approach,'' in AAAI, 2018."},{"key":"e_1_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-023-00790-4"},{"key":"e_1_2_1_83_1","volume-title":"Simple spectral graph convolution,'' in ICLR","author":"Zhu H.","year":"2021","unstructured":"H. Zhu and P. Koniusz, ''Simple spectral graph convolution,'' in ICLR, 2021."},{"key":"e_1_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"e_1_2_1_85_1","volume-title":"Structural deep clustering network,'' in Proceedings of The Web Conference","author":"Bo D.","year":"2020","unstructured":"D. Bo, X. Wang, C. Shi, M. Zhu, E. Lu, and P. Cui, ''Structural deep clustering network,'' in Proceedings of The Web Conference 2020. hskip 1em plus 0.5em minus 0.4emrelax Association for Computing Machinery, 2020, p. 1400-1410."},{"key":"e_1_2_1_86_1","volume-title":"Adaptive graph encoder for attributed graph embedding,'' KDD","author":"Cui G.","year":"2020","unstructured":"G. Cui, J. Zhou, C. Yang, and Z. Liu, ''Adaptive graph encoder for attributed graph embedding,'' KDD, 2020."},{"key":"e_1_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3125020"},{"key":"e_1_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i7.20726"},{"key":"e_1_2_1_89_1","volume-title":"Hierarchical graph convolutional networks for semi-supervised node classification,'' in IJCAI","author":"Hu F.","year":"2019","unstructured":"F. Hu, Y. Zhu, S. Wu, L. Wang, and T. Tan, ''Hierarchical graph convolutional networks for semi-supervised node classification,'' in IJCAI, 2019."},{"key":"e_1_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3150300"},{"key":"e_1_2_1_91_1","first-page":"3670","article-title":"Attributed graph clustering: a deep attentional embedding approach","author":"Wang C.","year":"2019","unstructured":"C. Wang, S. Pan, R. Hu, G. Long, J. Jiang, and C. Zhang, ''Attributed graph clustering: a deep attentional embedding approach,'' in IJCAI, 2019, pp. 3670-3676.","journal-title":"IJCAI"},{"key":"e_1_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-021-06723-y"},{"key":"e_1_2_1_93_1","first-page":"01098","article-title":"Cluster-guided contrastive graph clustering network","volume":"2301","author":"Yang X.","year":"2023","unstructured":"X. Yang, Y. Liu, S. Zhou, S. Wang, W. Tu, Q. Zheng, X. Liu, L. Fang, and E. Zhu, ''Cluster-guided contrastive graph clustering network,'' ArXiv, vol. abs\/2301.01098, 2023.","journal-title":"ArXiv"},{"key":"e_1_2_1_94_1","volume-title":"Graph debiased contrastive learning with joint representation clustering,'' in International Joint Conference on Artificial Intelligence","author":"Zhao H.","year":"2021","unstructured":"H. Zhao, X. Yang, Z. Wang, E. Yang, and C. Deng, ''Graph debiased contrastive learning with joint representation clustering,'' in International Joint Conference on Artificial Intelligence, 2021."},{"key":"e_1_2_1_95_1","volume-title":"Scalable attributed-graph subspace clustering,'' in AAAI","author":"Fettal C.","year":"2023","unstructured":"C. Fettal, L. Labiod, and M. Nadif, ''Scalable attributed-graph subspace clustering,'' in AAAI, vol. 37, 2023."},{"key":"e_1_2_1_96_1","volume-title":"On spectral clustering: Analysis and an algorithm,'' in Neural Information Processing Systems","author":"Ng A.","year":"2001","unstructured":"A. Ng, M. I. Jordan, and Y. Weiss, ''On spectral clustering: Analysis and an algorithm,'' in Neural Information Processing Systems, 2001."},{"key":"e_1_2_1_97_1","first-page":"1016","article-title":"Clustering with multiple graphs","author":"Tang W.","year":"2009","unstructured":"W. Tang, Z. Lu, and I. S. Dhillon, ''Clustering with multiple graphs,'' ICDM, pp. 1016-1021, 2009.","journal-title":"ICDM"},{"key":"e_1_2_1_98_1","volume-title":"Spectral clustering and transductive learning with multiple views,'' in ICML","author":"Zhou D.","year":"2007","unstructured":"D. Zhou and C. J. C. Burges, ''Spectral clustering and transductive learning with multiple views,'' in ICML, 2007."},{"key":"e_1_2_1_99_1","doi-asserted-by":"publisher","DOI":"10.1162\/153244303321897735"},{"key":"e_1_2_1_100_1","first-page":"447","volume-title":"Adaptive spectral co-clustering for multiview data,'' 2016 18th International Conference on Advanced Communication Technology (ICACT)","author":"Son J.-W.","year":"2016","unstructured":"J.-W. Son, J. Jeon, S.-Y. Lee, and S.-J. Kim, ''Adaptive spectral co-clustering for multiview data,'' 2016 18th International Conference on Advanced Communication Technology (ICACT), pp. 447-450, 2016."},{"key":"e_1_2_1_101_1","volume-title":"On regularizing multiple clusterings for ensemble clustering by graph tensor learning,'' MM","author":"Chen M.","year":"2023","unstructured":"M. Chen, J.-Q. Lin, C. Wang, W.-D. Xi, and D. Huang, ''On regularizing multiple clusterings for ensemble clustering by graph tensor learning,'' MM, 2023."},{"key":"e_1_2_1_102_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2021.3081930"},{"key":"e_1_2_1_103_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3172687"},{"key":"e_1_2_1_104_1","volume-title":"Multi-view clustering via canonical correlation analysis,'' in International Conference on Machine Learning","author":"Chaudhuri K.","year":"2009","unstructured":"K. Chaudhuri, S. M. Kakade, K. Livescu, and K. Sridharan, ''Multi-view clustering via canonical correlation analysis,'' in International Conference on Machine Learning, 2009."},{"key":"e_1_2_1_105_1","volume-title":"Convex multi-view subspace learning,'' in Neural Information Processing Systems","author":"White M.","year":"2012","unstructured":"M. White, Y. Yu, X. Zhang, and D. Schuurmans, ''Convex multi-view subspace learning,'' in Neural Information Processing Systems, 2012."},{"key":"e_1_2_1_106_1","first-page":"1","article-title":"Learning a mid-level feature space for cross-media regularization","author":"Wei Y.","year":"2014","unstructured":"Y. Wei, Y. Zhao, Z. Zhu, Y. Xiao, and S. Wei, ''Learning a mid-level feature space for cross-media regularization,'' ICME, pp. 1-6, 2014.","journal-title":"ICME"},{"key":"e_1_2_1_107_1","first-page":"1","article-title":"regularized multi-view subspace clustering","author":"Wang X.","year":"2017","unstructured":"X. Wang, X. Guo, Z. Lei, C. Zhang, and S. Li, ''Exclusivity-consistency regularized multi-view subspace clustering,'' CVPR, pp. 1-9, 2017.","journal-title":"CVPR"},{"key":"e_1_2_1_108_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3199587"},{"key":"e_1_2_1_109_1","first-page":"3577","article-title":"Deep multi-view subspace clustering with anchor graph","author":"Cui C.","year":"2023","unstructured":"C. Cui, Y. Ren, J. Pu, X. Pu, and L. He, \"Deep multi-view subspace clustering with anchor graph,\" in IJCAI, 2023, pp. 3577-3585.","journal-title":"IJCAI"},{"key":"e_1_2_1_110_1","volume-title":"Multi-view attribute graph convolution networks for clustering,\" in International Joint Conference on Artificial Intelligence","author":"Cheng J.","year":"2020","unstructured":"J. Cheng, Q. Wang, Z. Tao, D. Xie, and Q. Gao, \"Multi-view attribute graph convolution networks for clustering,\" in International Joint Conference on Artificial Intelligence, 2020."}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3769784","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T04:51:33Z","timestamp":1781326293000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3769784"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,4]]},"references-count":110,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,12,4]]}},"alternative-id":["10.1145\/3769784"],"URL":"https:\/\/doi.org\/10.1145\/3769784","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,4]]}}}