{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T16:06:45Z","timestamp":1784736405281,"version":"3.55.0"},"reference-count":195,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key R&#x0026;D Program of China","award":["2020AAA0107100"],"award-info":[{"award-number":["2020AAA0107100"]}]},{"name":"National Key R&#x0026;D Program of China","award":["2021ZD0140406"],"award-info":[{"award-number":["2021ZD0140406"]}]},{"name":"National Key R&#x0026;D Program of China","award":["2022ZD0115100"],"award-info":[{"award-number":["2022ZD0115100"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62325604"],"award-info":[{"award-number":["62325604"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62276271"],"award-info":[{"award-number":["62276271"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U21A20427"],"award-info":[{"award-number":["U21A20427"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62006237"],"award-info":[{"award-number":["62006237"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61922088"],"award-info":[{"award-number":["61922088"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61906020"],"award-info":[{"award-number":["61906020"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61773392"],"award-info":[{"award-number":["61773392"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Center for Industries of the Future","award":["WU2022C043"],"award-info":[{"award-number":["WU2022C043"]}]},{"name":"Competitive Research Fund","award":["WU2022A009"],"award-info":[{"award-number":["WU2022A009"]}]},{"name":"Westlake Center for Synthetic Biology and Integrated Bioengineering"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1109\/tkde.2026.3669747","type":"journal-article","created":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T20:54:14Z","timestamp":1772571254000},"page":"3365-3384","source":"Crossref","is-referenced-by-count":8,"title":["A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resource"],"prefix":"10.1109","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9894-0062","authenticated-orcid":false,"given":"Yue","family":"Liu","sequence":"first","affiliation":[{"name":"National University of Defense Technology, Changsha, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jun","family":"Xia","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology (Guangzhou), Guangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-4225-5924","authenticated-orcid":false,"given":"Benyu","family":"Wu","sequence":"additional","affiliation":[{"name":"Shandong University, Jinan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1491-4594","authenticated-orcid":false,"given":"Sihang","family":"Zhou","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, Changsha, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xihong","family":"Yang","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, Changsha, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4837-455X","authenticated-orcid":false,"given":"Ke","family":"Liang","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, Changsha, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8806-2166","authenticated-orcid":false,"given":"Chenchen","family":"Fan","sequence":"additional","affiliation":[{"name":"Chinese PLA General Hospital, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yan","family":"Zhuang","sequence":"additional","affiliation":[{"name":"Chinese PLA General Hospital, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guoxian","family":"Yu","sequence":"additional","affiliation":[{"name":"Shandong University, Jinan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2961-8096","authenticated-orcid":false,"given":"Stan Z.","family":"Li","sequence":"additional","affiliation":[{"name":"Westlake University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9066-1475","authenticated-orcid":false,"given":"Xinwang","family":"Liu","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, Changsha, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3335-5700","authenticated-orcid":false,"given":"Kunlun","family":"He","sequence":"additional","affiliation":[{"name":"Chinese PLA General Hospital, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/nature14539"},{"key":"ref2","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf","year":"2017"},{"key":"ref3","first-page":"1","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Veli\u010dkovi\u0107","year":"2018"},{"key":"ref4","article-title":"Variational graph auto-encoders","author":"Kipf","year":"2016"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3641549"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591711"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2024.3417451"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3282989"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3689036"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2024.3403155"},{"key":"ref11","article-title":"Clustering with deep learning: Taxonomy and new methods","author":"Aljalbout","year":"2018"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2855437"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2023.3242145"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3137396"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/693"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.8916"},{"key":"ref17","first-page":"1","article-title":"Sparse autoencoder","volume-title":"CS294 A Lecture Notes","volume":"72","author":"Ng","year":"2011"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.2307\/2346830"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10179"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783296"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132967"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.5555\/2969033.2969125"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/362"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2932096"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330866"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313564"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/509"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00662"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/601"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380214"},{"key":"ref32","first-page":"874","article-title":"Spectral clustering with graph neural networks for graph pooling","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Bianchi","year":"2020"},{"issue":"127","key":"ref33","first-page":"1","article-title":"Graph clustering with graph neural networks","volume":"24","author":"Tsitsulin","year":"2023","journal-title":"J. Mach. Learn. Res."},{"key":"ref34","first-page":"4805","article-title":"Hierarchical graph representation learning with differentiable pooling","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ying","year":"2018"},{"key":"ref35","first-page":"3734","article-title":"Self-attention graph pooling","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Lee","year":"2019"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380079"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/411"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2021.3094296"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i15.29664"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3674983"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2024.3353217"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i4.20392"},{"key":"ref43","first-page":"1","article-title":"Learning deep representations by mutual information estimation and maximization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Hjelm","year":"2018"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00975"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.5555\/3524938.3525087"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.5555\/3495724.3497510"},{"key":"ref47","first-page":"12310","article-title":"Barlow twins: Self-supervised learning via redundancy reduction","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"139","author":"Zbontar","year":"2021"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3186512"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/3581783.3611951"},{"key":"ref50","first-page":"1","article-title":"Deep graph infomax","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Velickovic","year":"2019"},{"key":"ref51","first-page":"1","article-title":"Deep graph contrastive representation learning","volume-title":"Proc. Int. Conf. Mach. Learn. Workshop Graph Representation Learn. Beyond","author":"Zhu","year":"2020"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512156"},{"key":"ref53","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"You","year":"2020"},{"key":"ref54","first-page":"1","article-title":"Bootstrapped representation learning on graphs","volume-title":"Proc. Int. Conf. Learn. Representations Workshop Geometrical Topological Representation Learn.","author":"Thakoor","year":"2021"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3282989"},{"key":"ref56","article-title":"An empirical study of graph contrastive learning","author":"Zhu","year":"2021"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403140"},{"key":"ref58","first-page":"4116","article-title":"Contrastive multi-view representation learning on graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Hassani","year":"2020"},{"key":"ref59","first-page":"2148","article-title":"Multi-view contrastive graph clustering","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Pan","year":"2021"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467415"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/473"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i7.20700"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3271871"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512186"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i7.20726"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2024.3406538"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i7.26071"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i9.26285"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3435887"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2025.104084"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v39i15.33779"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2025.3563646"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.52202\/068431-0235"},{"key":"ref74","first-page":"21794","article-title":"Dink-net: Neural clustering on large graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Liu","year":"2023"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599268"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/255"},{"key":"ref77","first-page":"26868","article-title":"Beyond homophily: Reconstructing structure for graph-agnostic clustering","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Pan","year":"2023"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3291696"},{"key":"ref79","first-page":"1","article-title":"Large language model guided graph clustering","volume-title":"Proc. 3rd Learn. Graphs Conf.","author":"Trivedi","year":"2024"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i14.29464"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v39i20.35473"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i10.28983"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2024.120951"},{"key":"ref84","article-title":"Evaluation metrics for unsupervised learning algorithms","author":"Palacio-Ni\u00f1o","year":"2019"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1109\/BIGCOMP.2019.8679398"},{"key":"ref86","article-title":"Normalized mutual information to evaluate overlapping community finding algorithms","author":"McDaid","year":"2011"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.9.763"},{"key":"ref88","volume-title":"Matching Theory","author":"Plummer","year":"1986"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1109\/ICCIMA.2007.328"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1088\/1757-899X\/569\/5\/052024"},{"key":"ref91","first-page":"53","article-title":"A comparison between the silhouette index and the Davies-Bouldin index in labelling IDS clusters","volume-title":"Proc. 11th Nordic Workshop Secure IT Syst.","author":"Petrovic","year":"2006"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/370"},{"key":"ref93","article-title":"Graph clustering with dynamic embedding","author":"Yang","year":"2017"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1145\/3581783.3612155"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1145\/3581783.3611809"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1145\/3664647.3680602"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5843"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i03.5673"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3108192"},{"key":"ref100","article-title":"RWR-GAE: Random walk regularization for graph auto encoders","author":"Huang","year":"2019"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3158654"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2022.109077"},{"key":"ref103","first-page":"5274","article-title":"Dirichlet graph variational autoencoder","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Li","year":"2020"},{"key":"ref104","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3171583"},{"key":"ref105","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV48922.2021.00909"},{"key":"ref106","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2023.109833"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/465"},{"key":"ref108","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.108334"},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.108230"},{"key":"ref110","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/192"},{"key":"ref111","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i8.20875"},{"key":"ref112","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2022.3213208"},{"key":"ref113","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412042"},{"key":"ref114","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i11.17198"},{"key":"ref115","doi-asserted-by":"publisher","DOI":"10.1145\/3474085.3475276"},{"key":"ref116","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2025.3582689"},{"key":"ref117","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16590"},{"key":"ref118","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512160"},{"key":"ref119","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2022.3168343"},{"key":"ref120","article-title":"Empirical evaluation of gated recurrent neural networks on sequence modeling","author":"Chung","year":"2014"},{"key":"ref121","first-page":"1","article-title":"Deep temporal graph clustering","volume-title":"Proc. Int. Conf. Learn. Representtion","author":"Liu","year":"2024"},{"key":"ref122","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2025.3596609"},{"key":"ref123","article-title":"arXiv4TGC: Large-scale datasets for temporal graph clustering","author":"Liu","year":"2023"},{"key":"ref124","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2025.3584384"},{"key":"ref125","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/494"},{"key":"ref126","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2023.126235"},{"key":"ref127","doi-asserted-by":"publisher","DOI":"10.1145\/3480244"},{"key":"ref128","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2023.126880"},{"key":"ref129","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2021.05.008"},{"key":"ref130","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3220948"},{"key":"ref131","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2022.3232604"},{"key":"ref132","first-page":"1","article-title":"Unsupervised network embedding beyond homophily","author":"Zhong","year":"2022","journal-title":"Trans. Mach. Learn. Res."},{"key":"ref133","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2024.128629"},{"key":"ref134","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/418"},{"key":"ref135","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3671967"},{"key":"ref136","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371806"},{"key":"ref137","doi-asserted-by":"publisher","DOI":"10.1145\/3488560.3498385"},{"key":"ref138","doi-asserted-by":"publisher","DOI":"10.1109\/72.159058"},{"key":"ref139","article-title":"Representation learning with contrastive predictive coding","author":"Oord","year":"2018"},{"key":"ref140","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01231-1_17"},{"key":"ref141","first-page":"1","article-title":"Automated self-supervised learning for graphs","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Jin","year":"2021"},{"key":"ref142","first-page":"1","article-title":"Multi-task self-supervised graph neural networks enable stronge task generalization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Ju","year":"2022"},{"key":"ref143","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-73003-5_196"},{"key":"ref144","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3184970"},{"key":"ref145","doi-asserted-by":"publisher","DOI":"10.1145\/3503161.3548334"},{"key":"ref146","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3268215"},{"key":"ref147","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2025.3582689"},{"key":"ref148","first-page":"1","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. Int. Conf. Learn. Representation","author":"Kingma","year":"2015"},{"key":"ref149","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"ref150","first-page":"22118","article-title":"Open graph benchmark: Datasets for machine learning on graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hu","year":"2020"},{"key":"ref151","doi-asserted-by":"publisher","DOI":"10.1037\/1089-2680.2.2.175"},{"key":"ref152","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hamilton","year":"2017"},{"key":"ref153","doi-asserted-by":"publisher","DOI":"10.1177\/0049124111404820"},{"key":"ref154","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2026.3680353"},{"key":"ref155","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/485"},{"key":"ref156","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.3032189"},{"key":"ref157","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9415073"},{"key":"ref158","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9053623"},{"key":"ref159","first-page":"478","article-title":"Unsupervised deep embedding for clustering analysis","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Xie","year":"2016"},{"key":"ref160","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/243"},{"key":"ref161","first-page":"37","article-title":"Autoencoders, unsupervised learning, and deep architectures","volume-title":"Proc. ICML Workshop Unsupervised Transfer Learn.","author":"Baldi","year":"2012"},{"key":"ref162","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.485"},{"key":"ref163","doi-asserted-by":"publisher","DOI":"10.1109\/WACV.2018.00093"},{"key":"ref164","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623612"},{"issue":"1","key":"ref165","first-page":"1","article-title":"Random walks on graphs","volume-title":"Combinatorics, Paul Erdos Eighty","volume":"2","author":"Lov\u00e1sz","year":"1993"},{"key":"ref166","first-page":"3861","article-title":"Towards K-means-friendly spaces: Simultaneous deep learning and clustering","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yang","year":"2017"},{"key":"ref167","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref168","first-page":"24332","article-title":"ProGCL: Rethinking hard negative mining in graph contrastive learning","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"162","author":"Xia","year":"2022"},{"key":"ref169","first-page":"1360","article-title":"Nested mini-batch K-means","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Newling","year":"2016"},{"key":"ref170","doi-asserted-by":"publisher","DOI":"10.1109\/cvpr52688.2022.00955"},{"key":"ref171","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3187976"},{"key":"ref172","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3172903"},{"key":"ref173","doi-asserted-by":"publisher","DOI":"10.1126\/science.1242072"},{"key":"ref174","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2743240"},{"key":"ref175","first-page":"90","article-title":"Review on determining of cluster in k-means clustering review on determining number of cluster in k-means clustering","volume":"1","author":"Makwana","year":"2013","journal-title":"Int. J. Adv. Res. Comput. Sci. Manage. Stud."},{"key":"ref176","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00121"},{"key":"ref177","first-page":"1","article-title":"Ada-NETS: Face clustering via adaptive neighbour discovery in the structure space","volume-title":"Proc. Int. Conf. Learn. Representation","author":"Wang","year":"2022"},{"key":"ref178","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00907"},{"key":"ref179","first-page":"9758","article-title":"Self-supervised learning by cross-modal audio-video clustering","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Alwassel","year":"2020"},{"key":"ref180","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.acl-main.366"},{"key":"ref181","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2989833"},{"key":"ref182","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.emnlp-main.858"},{"key":"ref183","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132925"},{"key":"ref184","doi-asserted-by":"publisher","DOI":"10.1145\/3341161.3342890"},{"key":"ref185","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2852958"},{"key":"ref186","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/693"},{"key":"ref187","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3066111"},{"key":"ref188","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3118815"},{"key":"ref189","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512090"},{"key":"ref190","doi-asserted-by":"publisher","DOI":"10.3390\/ijerph19138102"},{"key":"ref191","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/760"},{"key":"ref192","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i4.20388"},{"key":"ref193","doi-asserted-by":"publisher","DOI":"10.3389\/fncom.2019.00031"},{"key":"ref194","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.11.102"},{"key":"ref195","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1478\/1\/012024"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/11503382\/11419855.pdf?arnumber=11419855","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T05:02:13Z","timestamp":1777698133000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11419855\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":195,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2026.3669747","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6]]}}}