{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T20:20:36Z","timestamp":1784751636892,"version":"3.55.0"},"reference-count":50,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"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-017"},{"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"},{"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-012"},{"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-004"}],"funder":[{"DOI":"10.13039\/501100017596","name":"Natural Science Basic Research Program of Shaanxi Province","doi-asserted-by":"publisher","award":["2025JCYBMS-678"],"award-info":[{"award-number":["2025JCYBMS-678"]}],"id":[{"id":"10.13039\/501100017596","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["92371101"],"award-info":[{"award-number":["92371101"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012456","name":"National Social Science Fund of China","doi-asserted-by":"publisher","award":["23BTJ053"],"award-info":[{"award-number":["23BTJ053"]}],"id":[{"id":"10.13039\/501100012456","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Approximate Reasoning"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.ijar.2026.109657","type":"journal-article","created":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T00:34:46Z","timestamp":1772498086000},"page":"109657","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["HALO: Hardness-aware bilevel-inspired contrastive graph clustering"],"prefix":"10.1016","volume":"193","author":[{"given":"Yuchen","family":"Zhu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7278-3652","authenticated-orcid":false,"given":"Kuang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haishan","family":"Ye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guang","family":"Dai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ivor W.","family":"Tsang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ijar.2026.109657_bib0001","doi-asserted-by":"crossref","DOI":"10.1016\/j.ijar.2023.109104","article-title":"Graph representation learning method based on three-way partial order structure","volume":"165","author":"Yan","year":"2024","journal-title":"Int. J. Approximate Reasoning"},{"issue":"7","key":"10.1016\/j.ijar.2026.109657_bib0002","doi-asserted-by":"crossref","first-page":"13177","DOI":"10.1109\/TNNLS.2024.3473618","article-title":"CDC: a simple framework for complex data clustering","volume":"36","author":"Kang","year":"2025","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"3","key":"10.1016\/j.ijar.2026.109657_bib0003","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1109\/TNNLS.2025.3618290","article-title":"Be reliable: an interpretable attribute-oriented representation learning framework","volume":"37","author":"Fang","year":"2025","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"6","key":"10.1016\/j.ijar.2026.109657_bib0004","doi-asserted-by":"crossref","first-page":"3312","DOI":"10.1109\/TKDE.2025.3548160","article-title":"Dual test-time training for out-of-distribution recommender system","volume":"37","author":"Yang","year":"2025","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.ijar.2026.109657_bib0005","doi-asserted-by":"crossref","DOI":"10.1016\/j.inffus.2024.102846","article-title":"Efficient self-supervised heterogeneous graph representation learning with reconstruction","volume":"117","author":"Mo","year":"2025","journal-title":"Inf. Fusion"},{"key":"10.1016\/j.ijar.2026.109657_bib0006","series-title":"International Conference on Learning Representations","article-title":"Contrastive learning with hard negative samples","author":"Robinson","year":"2021"},{"key":"10.1016\/j.ijar.2026.109657_bib0007","series-title":"International Conference on Machine Learning","first-page":"1597","article-title":"A simple framework for contrastive learning of visual representations","author":"Chen","year":"2020"},{"key":"10.1016\/j.ijar.2026.109657_bib0008","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2024.121225","article-title":"Attributed graph clustering under the contrastive mechanism with cluster-preserving augmentation","volume":"681","author":"Zheng","year":"2024","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ijar.2026.109657_bib0009","doi-asserted-by":"crossref","DOI":"10.1016\/j.neunet.2024.106927","article-title":"Deep graph clustering via aligning representation learning","volume":"183","author":"Chen","year":"2025","journal-title":"Neural Netw."},{"key":"10.1016\/j.ijar.2026.109657_bib0010","series-title":"2024 IEEE International Conference on Web Services","first-page":"1198","article-title":"A debiased graph clustering approach using dual contrastive learning","author":"Gao","year":"2024"},{"issue":"11","key":"10.1016\/j.ijar.2026.109657_bib0011","doi-asserted-by":"crossref","first-page":"16748","DOI":"10.1109\/TNNLS.2023.3297607","article-title":"Hierarchically contrastive hard sample mining for graph self-supervised pretraining","volume":"35","author":"Tu","year":"2024","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"10.1016\/j.ijar.2026.109657_bib0012","series-title":"International Conference on Machine Learning","first-page":"24332","article-title":"ProGCL: rethinking hard negative mining in graph contrastive learning","author":"Xia","year":"2022"},{"issue":"3","key":"10.1016\/j.ijar.2026.109657_bib0013","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3689036","article-title":"A comprehensive survey on deep clustering: taxonomy, challenges, and future directions","volume":"57","author":"Zhou","year":"2024","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/j.ijar.2026.109657_bib0014","series-title":"IJCAI","first-page":"4611","article-title":"Multi-level graph contrastive prototypical clustering","author":"Zhang","year":"2023"},{"key":"10.1016\/j.ijar.2026.109657_bib0015","series-title":"IJCAI","first-page":"3015","article-title":"Attributed graph clustering with dual redundancy reduction","author":"Gong","year":"2022"},{"key":"10.1016\/j.ijar.2026.109657_bib0016","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence","first-page":"8547","article-title":"Contrastive clustering","volume":"35","author":"Li","year":"2021"},{"key":"10.1016\/j.ijar.2026.109657_bib0017","doi-asserted-by":"crossref","DOI":"10.1016\/j.ijar.2025.109552","article-title":"FCPCA: fuzzy clustering of high-dimensional time series based on common principal component analysis","volume":"187","author":"Ma","year":"2025","journal-title":"Int. J. Approximate Reasoning"},{"key":"10.1016\/j.ijar.2026.109657_bib0018","doi-asserted-by":"crossref","DOI":"10.1016\/j.ijar.2024.109169","article-title":"An auto-weighted enhanced horizontal collaborative fuzzy clustering algorithm with knowledge adaption mechanism","volume":"169","author":"Yang","year":"2024","journal-title":"Int. J. Approximate Reasoning"},{"key":"10.1016\/j.ijar.2026.109657_bib0019","doi-asserted-by":"crossref","DOI":"10.1016\/j.ijar.2025.109400","article-title":"DEEM: a novel approach to semi-supervised and unsupervised image clustering under uncertainty using belief functions and convolutional neural networks","volume":"181","author":"Guiziou","year":"2025","journal-title":"Int. J. Approximate Reasoning"},{"key":"10.1016\/j.ijar.2026.109657_bib0020","doi-asserted-by":"crossref","DOI":"10.1109\/TCYB.2026.3668393","article-title":"TDCC: A Trustworthy Deep Credal Clustering Method for Uncertain Data","author":"Zhu","year":"2026","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.ijar.2026.109657_bib0021","doi-asserted-by":"crossref","DOI":"10.1016\/j.ijar.2023.109075","article-title":"GFDC: a granule fusion density-based clustering with evidential reasoning","volume":"164","author":"Cai","year":"2024","journal-title":"Int. J. Approximate Reasoning"},{"key":"10.1016\/j.ijar.2026.109657_bib0022","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2024.111108","article-title":"MvWECM: multi-view weighted evidential c-means clustering","volume":"159","author":"Zhou","year":"2025","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.ijar.2026.109657_bib0023","doi-asserted-by":"crossref","DOI":"10.1016\/j.ijar.2025.109457","article-title":"Three-way space structure and clustering of categorical data","volume":"184","author":"Zhang","year":"2025","journal-title":"Int. J. Approximate Reasoning"},{"key":"10.1016\/j.ijar.2026.109657_bib0024","doi-asserted-by":"crossref","first-page":"2476","DOI":"10.1109\/TPAMI.2025.3626645","article-title":"A review of uncertainty representation and quantification in neural networks","volume":"48","author":"Wang","year":"2026","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.ijar.2026.109657_bib0025","doi-asserted-by":"crossref","first-page":"1020","DOI":"10.1109\/TR.2026.3660916","article-title":"Reliability Analysis Based on Evidential Likelihood for Uncertain Mixed Weibull Distribution","volume":"75","author":"Zhou","year":"2026","journal-title":"IEEE Trans. Reliab."},{"issue":"3","key":"10.1016\/j.ijar.2026.109657_bib0026","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10489-024-06125-2","article-title":"ULDC: uncertainty-based learning for deep clustering","volume":"55","author":"Chang","year":"2025","journal-title":"Appl. Intell."},{"key":"10.1016\/j.ijar.2026.109657_bib0027","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2025.130568","article-title":"Uncertainty-aware contrastive learning for deep clustering","volume":"647","author":"Chang","year":"2025","journal-title":"Neurocomputing"},{"key":"10.1016\/j.ijar.2026.109657_bib0028","series-title":"IJCAI","first-page":"3434","article-title":"Graph debiased contrastive learning with joint representation clustering","author":"Zhao","year":"2021"},{"issue":"3","key":"10.1016\/j.ijar.2026.109657_bib0029","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2024.104050","article-title":"Contrastive deep graph clustering with hard boundary sample awareness","volume":"62","author":"Zhu","year":"2025","journal-title":"Inf. Process. Manage."},{"key":"10.1016\/j.ijar.2026.109657_bib0030","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence","first-page":"7603","article-title":"Deep graph clustering via dual correlation reduction","volume":"36","author":"Liu","year":"2022"},{"issue":"12","key":"10.1016\/j.ijar.2026.109657_bib0031","doi-asserted-by":"crossref","first-page":"18313","DOI":"10.1109\/TNNLS.2023.3314451","article-title":"Redundancy-free self-supervised relational learning for graph clustering","volume":"35","author":"Yi","year":"2024","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"10.1016\/j.ijar.2026.109657_bib0032","series-title":"Technical Report","article-title":"The PageRank Citation Ranking: Bringing Order to the Web","author":"Page","year":"1999"},{"key":"10.1016\/j.ijar.2026.109657_bib0033","series-title":"Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition","first-page":"15750","article-title":"Exploring simple siamese representation learning","author":"Chen","year":"2021"},{"key":"10.1016\/j.ijar.2026.109657_bib0034","series-title":"IJCAI","article-title":"Dual contrastive graph-level clustering with multiple cluster perspectives alignment","author":"Cai","year":"2024"},{"issue":"3","key":"10.1016\/j.ijar.2026.109657_bib0035","doi-asserted-by":"crossref","first-page":"1868","DOI":"10.1109\/TCYB.2023.3273535","article-title":"Multitask image clustering via deep information bottleneck","volume":"54","author":"Yan","year":"2024","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.ijar.2026.109657_bib0036","series-title":"Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition","first-page":"5022","article-title":"Multi-similarity loss with general pair weighting for deep metric learning","author":"Wang","year":"2019"},{"key":"10.1016\/j.ijar.2026.109657_bib0037","series-title":"International Conference on Data Engineering","first-page":"1171","article-title":"GradGCL: gradient graph contrastive learning","author":"Li","year":"2024"},{"key":"10.1016\/j.ijar.2026.109657_bib0038","series-title":"European Conference on Computer Vision","first-page":"668","article-title":"Decoupled contrastive learning","author":"Yeh","year":"2022"},{"key":"10.1016\/j.ijar.2026.109657_bib0039","series-title":"Advances in Neural Information Processing Systems","first-page":"2292-2300","article-title":"Sinkhorn distances: lightspeed computation of optimal transport","volume":"26","author":"Cuturi","year":"2013"},{"key":"10.1016\/j.ijar.2026.109657_bib0040","series-title":"Proceedings of the International Conference on Artificial Intelligence and Statistics","first-page":"249","article-title":"Understanding the difficulty of training deep feedforward neural networks","author":"Glorot","year":"2010"},{"key":"10.1016\/j.ijar.2026.109657_bib0041","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence","first-page":"8914","article-title":"Hard sample aware network for contrastive deep graph clustering","volume":"37","author":"Liu","year":"2023"},{"key":"10.1016\/j.ijar.2026.109657_bib0042","series-title":"International Conference on Machine Learning","first-page":"26868","article-title":"Beyond homophily: reconstructing structure for graph-agnostic clustering","author":"Pan","year":"2023"},{"key":"10.1016\/j.ijar.2026.109657_bib0043","series-title":"International Conference on Learning Representations","article-title":"A critical look at evaluation of GNNs under heterophily: are we really making progress?","author":"Platonov","year":"2023"},{"key":"10.1016\/j.ijar.2026.109657_bib0044","series-title":"Matching Theory","volume":"367","author":"Lov\u00e1sz","year":"2009"},{"key":"10.1016\/j.ijar.2026.109657_bib0045","series-title":"International Conference on Machine Learning","first-page":"3451","article-title":"Contrastive multi-view representation learning on graphs","author":"Hassani","year":"2020"},{"key":"10.1016\/j.ijar.2026.109657_bib0046","series-title":"ACM Multimedia","first-page":"935","article-title":"Attention-driven graph clustering network","author":"Peng","year":"2021"},{"key":"10.1016\/j.ijar.2026.109657_bib0047","series-title":"International Conference on Machine Learning","first-page":"21794","article-title":"Dink-net: neural clustering on large graphs","author":"Liu","year":"2023"},{"issue":"4","key":"10.1016\/j.ijar.2026.109657_bib0048","doi-asserted-by":"crossref","first-page":"1951","DOI":"10.1109\/TFUZZ.2023.3338565","article-title":"Fuzzy-based deep attributed graph clustering","volume":"32","author":"Yang","year":"2024","journal-title":"IEEE Trans. Fuzzy Syst."},{"key":"10.1016\/j.ijar.2026.109657_bib0049","series-title":"Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","first-page":"1968","article-title":"Revisiting modularity maximization for graph clustering: a contrastive learning perspective","author":"Liu","year":"2024"},{"issue":"10","key":"10.1016\/j.ijar.2026.109657_bib0050","doi-asserted-by":"crossref","first-page":"10213","DOI":"10.1109\/TCSVT.2025.3563646","article-title":"Homophily induced contrastive attributed graph clustering","volume":"35","author":"Chen","year":"2025","journal-title":"IEEE Trans. Circuits Syst. Video Technol."}],"container-title":["International Journal of Approximate Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0888613X26000332?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0888613X26000332?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T19:43:08Z","timestamp":1784749388000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0888613X26000332"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":50,"alternative-id":["S0888613X26000332"],"URL":"https:\/\/doi.org\/10.1016\/j.ijar.2026.109657","relation":{},"ISSN":["0888-613X"],"issn-type":[{"value":"0888-613X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"HALO: Hardness-aware bilevel-inspired contrastive graph clustering","name":"articletitle","label":"Article Title"},{"value":"International Journal of Approximate Reasoning","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ijar.2026.109657","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"109657"}}