Tianxiang Zhao , Youqing Wang , Shilong Xu , Tianchuan Yang , Junbin Gao , Jipeng Guo
{"title":"基于三重智能对比学习的双水平噪声增强图聚类","authors":"Tianxiang Zhao , Youqing Wang , Shilong Xu , Tianchuan Yang , Junbin Gao , Jipeng Guo","doi":"10.1016/j.patcog.2025.112463","DOIUrl":null,"url":null,"abstract":"<div><div>Contrastive deep graph clustering has attracted widespread attention due to its self-supervised representation learning mechanism and excellent clustering performance. Although, most existing methods rely on low-pass filtering to achieve denoising, ignoring the potential benefit of high-frequency information and noise in obtaining comprehensive and robust representation. Second, commonly used contrastive learning strategies generally treat non-target samples as negative samples, which is prone to triggering contrastive bias and weakening the representation quality. To this end, this paper proposes a novel contrastive graph clustering framework, Dual-level Noise Augmentation for Graph Clustering with triplet-wise Contrastive learning (DNA-CGC), strengthening the benefit of noise to enrich the representation learning and amplify the contrastive learning efficacy. It consists of two core modules, Hybrid Noise Representation Augmentation (HNRA) and Noise-Aware Contrastive Learning (NACL). The HNRA module integrates low- and high-frequency graph signals to capture both shared and distinctive node characteristics, while introducing Gaussian noise as beneficial perturbation to enrich the representation diversity, thereby achieving multi-information fusion under hybrid noise. The NACL module, on the other hand, generates exclusive negative samples through Gaussian noise and constructs the triplet-wise contrastive pairs (Target, Positive, Negative), mitigating the contrastive bias by preventing false negatives and further facilitating more accurate semantic alignment. Extensive experiments on six benchmark datasets validate the significant advantages of DNA-CGC in terms of clustering performance and representation quality. The code could be available at <span><span>https://github.com/TianxiangZhao0474/DNA-CGC.git</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":49713,"journal":{"name":"Pattern Recognition","volume":"172 ","pages":"Article 112463"},"PeriodicalIF":7.6000,"publicationDate":"2025-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Dual-level noise augmentation for graph clustering with triplet-wise contrastive learning\",\"authors\":\"Tianxiang Zhao , Youqing Wang , Shilong Xu , Tianchuan Yang , Junbin Gao , Jipeng Guo\",\"doi\":\"10.1016/j.patcog.2025.112463\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Contrastive deep graph clustering has attracted widespread attention due to its self-supervised representation learning mechanism and excellent clustering performance. Although, most existing methods rely on low-pass filtering to achieve denoising, ignoring the potential benefit of high-frequency information and noise in obtaining comprehensive and robust representation. Second, commonly used contrastive learning strategies generally treat non-target samples as negative samples, which is prone to triggering contrastive bias and weakening the representation quality. To this end, this paper proposes a novel contrastive graph clustering framework, Dual-level Noise Augmentation for Graph Clustering with triplet-wise Contrastive learning (DNA-CGC), strengthening the benefit of noise to enrich the representation learning and amplify the contrastive learning efficacy. It consists of two core modules, Hybrid Noise Representation Augmentation (HNRA) and Noise-Aware Contrastive Learning (NACL). The HNRA module integrates low- and high-frequency graph signals to capture both shared and distinctive node characteristics, while introducing Gaussian noise as beneficial perturbation to enrich the representation diversity, thereby achieving multi-information fusion under hybrid noise. The NACL module, on the other hand, generates exclusive negative samples through Gaussian noise and constructs the triplet-wise contrastive pairs (Target, Positive, Negative), mitigating the contrastive bias by preventing false negatives and further facilitating more accurate semantic alignment. Extensive experiments on six benchmark datasets validate the significant advantages of DNA-CGC in terms of clustering performance and representation quality. The code could be available at <span><span>https://github.com/TianxiangZhao0474/DNA-CGC.git</span><svg><path></path></svg></span>.</div></div>\",\"PeriodicalId\":49713,\"journal\":{\"name\":\"Pattern Recognition\",\"volume\":\"172 \",\"pages\":\"Article 112463\"},\"PeriodicalIF\":7.6000,\"publicationDate\":\"2025-09-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Pattern Recognition\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0031320325011264\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Pattern Recognition","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0031320325011264","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
Dual-level noise augmentation for graph clustering with triplet-wise contrastive learning
Contrastive deep graph clustering has attracted widespread attention due to its self-supervised representation learning mechanism and excellent clustering performance. Although, most existing methods rely on low-pass filtering to achieve denoising, ignoring the potential benefit of high-frequency information and noise in obtaining comprehensive and robust representation. Second, commonly used contrastive learning strategies generally treat non-target samples as negative samples, which is prone to triggering contrastive bias and weakening the representation quality. To this end, this paper proposes a novel contrastive graph clustering framework, Dual-level Noise Augmentation for Graph Clustering with triplet-wise Contrastive learning (DNA-CGC), strengthening the benefit of noise to enrich the representation learning and amplify the contrastive learning efficacy. It consists of two core modules, Hybrid Noise Representation Augmentation (HNRA) and Noise-Aware Contrastive Learning (NACL). The HNRA module integrates low- and high-frequency graph signals to capture both shared and distinctive node characteristics, while introducing Gaussian noise as beneficial perturbation to enrich the representation diversity, thereby achieving multi-information fusion under hybrid noise. The NACL module, on the other hand, generates exclusive negative samples through Gaussian noise and constructs the triplet-wise contrastive pairs (Target, Positive, Negative), mitigating the contrastive bias by preventing false negatives and further facilitating more accurate semantic alignment. Extensive experiments on six benchmark datasets validate the significant advantages of DNA-CGC in terms of clustering performance and representation quality. The code could be available at https://github.com/TianxiangZhao0474/DNA-CGC.git.
期刊介绍:
The field of Pattern Recognition is both mature and rapidly evolving, playing a crucial role in various related fields such as computer vision, image processing, text analysis, and neural networks. It closely intersects with machine learning and is being applied in emerging areas like biometrics, bioinformatics, multimedia data analysis, and data science. The journal Pattern Recognition, established half a century ago during the early days of computer science, has since grown significantly in scope and influence.