Multi-Scale Sub-graph View Generation and Siamese Contrastive Learning for Graph Representations

IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Rende Hong , Kaibiao Lin , Binsheng Hong , Zhaori Guo , Fan Yang
{"title":"Multi-Scale Sub-graph View Generation and Siamese Contrastive Learning for Graph Representations","authors":"Rende Hong ,&nbsp;Kaibiao Lin ,&nbsp;Binsheng Hong ,&nbsp;Zhaori Guo ,&nbsp;Fan Yang","doi":"10.1016/j.asoc.2025.113608","DOIUrl":null,"url":null,"abstract":"<div><div>Graph Contrastive Learning (GCL) is an essential technique in extracting structural and node-related information in graph representation learning. Most existing GCL methods rely on data augmentation to generate multiple views of a graph, aiming to maintain consistency across them via contrastive learning. However, these approaches usually have two limitations: (1) the views generated by the random perturb strategy often disrupt the critical information of the graph, and (2) the graph contrastive strategy is challenging to comprehensively construct contrastive samples between views. To address the challenges mentioned above, we propose an innovative GCL method called the Multi-Scale Sub-graph View Generation and Siamese Contrastive Learning for Graph Representations method (M3SGCL), which consists of three modules. First, the view generation module generates two novel augmented views by introducing multiple structure views and sampled sub-graph sets, which prevents the original graph structure from being damaged, providing a deep understanding of global graph information. Second, the Siamese Network module processes multiple sub-graph views using an online encoder and a target encoder, generating multi-scale representations that enrich the selection of high-quality positive and negative sample pairs for contrastive learning. Third, to further reduce the risk of the information loss and incomplete sample construction, the contrastive learning module establishes multiple contrastive paths through the Siamese Network and employs a multi-scale loss function to learn robust and informative representations. In addition, we perform comprehensive experiments on five real-world datasets, and the results show that M3SGCL significantly outperforms ten state-of-the-art baselines, especially achieving an improvement of 19.76% compared to the second-best method on the Wisconsin dataset. These results demonstrate that our method effectively captures more nuanced and informative graph information by constructing subgraph views and introducing an enhanced multi-scale comparison strategy.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"182 ","pages":"Article 113608"},"PeriodicalIF":7.2000,"publicationDate":"2025-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494625009196","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Graph Contrastive Learning (GCL) is an essential technique in extracting structural and node-related information in graph representation learning. Most existing GCL methods rely on data augmentation to generate multiple views of a graph, aiming to maintain consistency across them via contrastive learning. However, these approaches usually have two limitations: (1) the views generated by the random perturb strategy often disrupt the critical information of the graph, and (2) the graph contrastive strategy is challenging to comprehensively construct contrastive samples between views. To address the challenges mentioned above, we propose an innovative GCL method called the Multi-Scale Sub-graph View Generation and Siamese Contrastive Learning for Graph Representations method (M3SGCL), which consists of three modules. First, the view generation module generates two novel augmented views by introducing multiple structure views and sampled sub-graph sets, which prevents the original graph structure from being damaged, providing a deep understanding of global graph information. Second, the Siamese Network module processes multiple sub-graph views using an online encoder and a target encoder, generating multi-scale representations that enrich the selection of high-quality positive and negative sample pairs for contrastive learning. Third, to further reduce the risk of the information loss and incomplete sample construction, the contrastive learning module establishes multiple contrastive paths through the Siamese Network and employs a multi-scale loss function to learn robust and informative representations. In addition, we perform comprehensive experiments on five real-world datasets, and the results show that M3SGCL significantly outperforms ten state-of-the-art baselines, especially achieving an improvement of 19.76% compared to the second-best method on the Wisconsin dataset. These results demonstrate that our method effectively captures more nuanced and informative graph information by constructing subgraph views and introducing an enhanced multi-scale comparison strategy.
图表示的多尺度子图视图生成与暹罗对比学习
图对比学习(GCL)是图表示学习中提取结构信息和节点相关信息的关键技术。大多数现有的GCL方法依赖于数据增强来生成一个图的多个视图,旨在通过对比学习来保持它们之间的一致性。然而,这些方法通常有两个局限性:(1)随机摄动策略生成的视图通常会破坏图的关键信息;(2)图对比策略很难在视图之间全面构建对比样本。为了解决上述挑战,我们提出了一种创新的GCL方法,称为多尺度子图视图生成和暹罗对比学习图表示方法(M3SGCL),该方法由三个模块组成。首先,视图生成模块通过引入多个结构视图和采样子图集生成两个新的增强视图,避免了原始图结构被破坏,提供了对全局图信息的深入理解;其次,Siamese Network模块使用在线编码器和目标编码器处理多个子图视图,生成多尺度表示,丰富了用于对比学习的高质量正负样本对的选择。第三,为了进一步降低信息丢失和样本构建不完整的风险,对比学习模块通过Siamese网络建立多条对比路径,并采用多尺度损失函数学习鲁棒且信息丰富的表征。此外,我们在5个真实数据集上进行了全面的实验,结果表明,M3SGCL显著优于10个最先进的基线,特别是与威斯康星数据集上第二好的方法相比,提高了19.76%。这些结果表明,我们的方法通过构建子图视图和引入增强的多尺度比较策略,有效地捕获了更多细致入微的信息。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Applied Soft Computing
Applied Soft Computing 工程技术-计算机:跨学科应用
CiteScore
15.80
自引率
6.90%
发文量
874
审稿时长
10.9 months
期刊介绍: Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities. Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信