Attention-aware graph contrastive learning with topological relationship for recommendation

IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Applied Soft Computing Pub Date : 2025-04-01 Epub Date: 2025-03-16 DOI:10.1016/j.asoc.2025.113008
Xian Mo , Jun Pang , Zihang Zhao
{"title":"Attention-aware graph contrastive learning with topological relationship for recommendation","authors":"Xian Mo ,&nbsp;Jun Pang ,&nbsp;Zihang Zhao","doi":"10.1016/j.asoc.2025.113008","DOIUrl":null,"url":null,"abstract":"<div><div>Recommender systems are a vital tool to guide the overwhelming amount of online information for users, which has been successfully applied to online retail platforms, social networks, etc. Recently, contrastive learning has revealed outstanding performance in recommendation by data augmentation strategies to handle highly sparse data. Most existing work fails to leverage the original network’s topology to construct attention-aware modules that identify user–item interaction importance for guiding node aggregation while preserving key semantics and reducing noise in the reconstructed graph during data augmentation. In this paper, our work proposes an <u>At</u>t<u>e</u>ntion-aware <u>G</u>raph <u>C</u>ontrastive <u>L</u>earning architecture with Topological Relationship (AteGCL) for recommendation. In particular, our AteGCL proposes an attention-aware mechanism with topological relationships to learn the importance between users and items for extracting the local graph dependency, which identifies the importance between nodes by constructing an attention-aware matrix into graph convolutional networks using a random walk with a restart strategy for generating node feature aggregation. We then employ principal component analysis (PCA) for contrastive augmentation and utilize the attention-aware matrix to ease noise from the reconstructed graph generated by PCA and to generate a new view with global collaborative relationships and less noise. Comprehensive experiments on three real-world user–item networks reveal the superiority of our AteGCL over diverse state-of-the-art recommendation approaches. Our code is available at <span><span>https://github.com/ZZHCodeZera/AteGCL</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"174 ","pages":"Article 113008"},"PeriodicalIF":6.6000,"publicationDate":"2025-04-01","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/S1568494625003199","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/3/16 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Recommender systems are a vital tool to guide the overwhelming amount of online information for users, which has been successfully applied to online retail platforms, social networks, etc. Recently, contrastive learning has revealed outstanding performance in recommendation by data augmentation strategies to handle highly sparse data. Most existing work fails to leverage the original network’s topology to construct attention-aware modules that identify user–item interaction importance for guiding node aggregation while preserving key semantics and reducing noise in the reconstructed graph during data augmentation. In this paper, our work proposes an Attention-aware Graph Contrastive Learning architecture with Topological Relationship (AteGCL) for recommendation. In particular, our AteGCL proposes an attention-aware mechanism with topological relationships to learn the importance between users and items for extracting the local graph dependency, which identifies the importance between nodes by constructing an attention-aware matrix into graph convolutional networks using a random walk with a restart strategy for generating node feature aggregation. We then employ principal component analysis (PCA) for contrastive augmentation and utilize the attention-aware matrix to ease noise from the reconstructed graph generated by PCA and to generate a new view with global collaborative relationships and less noise. Comprehensive experiments on three real-world user–item networks reveal the superiority of our AteGCL over diverse state-of-the-art recommendation approaches. Our code is available at https://github.com/ZZHCodeZera/AteGCL.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于拓扑关系的推荐注意感知图对比学习
推荐系统是为用户引导海量网络信息的重要工具,已成功应用于在线零售平台、社交网络等。近年来,对比学习在数据增强策略推荐处理高度稀疏数据方面表现突出。大多数现有工作未能利用原始网络的拓扑结构来构建注意力感知模块,这些模块识别用户-项目交互的重要性,以指导节点聚合,同时在数据增强期间保留关键语义并降低重构图中的噪声。在本文中,我们的工作提出了一个带有拓扑关系的注意感知图对比学习架构(AteGCL)。特别是,我们的AteGCL提出了一种具有拓扑关系的注意力感知机制来学习用户和项目之间的重要性,以提取局部图依赖关系,该机制通过使用随机行走和重新启动策略将注意力感知矩阵构建到图卷积网络中来识别节点之间的重要性,从而生成节点特征聚合。然后,我们采用主成分分析(PCA)进行对比增强,并利用注意感知矩阵来消除主成分分析生成的重构图中的噪声,从而生成具有全局协作关系和低噪声的新视图。在三个真实世界的用户-物品网络上进行的综合实验表明,我们的AteGCL优于各种最先进的推荐方法。我们的代码可在https://github.com/ZZHCodeZera/AteGCL上获得。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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.
期刊最新文献
ISTCLR: Improved sparse temporal contrastive learning for video representation ModuleCNN: A modular framework for unified CNN architecture and hyperparameter optimization via metaheuristics in image classification Modeling and treatment of social media addiction using a fractional-order and deep neural network approach Embedding contrastive memory into variational autoencoder for anomaly detection in IIoT systems A global and local encoder fusion network for pavement crack segmentation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1