面向推荐的图局部相似度对比学习

IF 7.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Zhou Zhou, Zheng Hu, Shi-Min Cai, Tao Zhou
{"title":"面向推荐的图局部相似度对比学习","authors":"Zhou Zhou,&nbsp;Zheng Hu,&nbsp;Shi-Min Cai,&nbsp;Tao Zhou","doi":"10.1016/j.eswa.2025.127855","DOIUrl":null,"url":null,"abstract":"<div><div>Graph Contrastive Learning (GCL) has recently gained widespread adoption in recommendation systems owing to its outstanding performance and capability to alleviate data sparsity issues. GCL mitigates data sparsity issues by learning more uniformly distributed user and item representations. However, current recommendation approaches based on GCL have a significant drawback, which is to overlook the relationships between homogeneous nodes (i.e., users to users and items to items). The potential of contrastive learning in these contexts remains largely untapped because contrastive learning often focuses only on the user–item interaction space, missing the fine-grained, contextual similarities that exist within homogeneous nodes. These overlooked relationships can significantly improve recommendation accuracy by providing richer, more context-sensitive embeddings. To address this problem, we propose a Graph Local Similarity Contrastive Learning (GLSCL) framework, which enhances embedding uniformity and constructs contrast pairs based on local similarity. Specifically, to avoid the loss of original information, we employ a random perturbation contrastive task to enhance embedding uniformity and improve recommendation performance by exploring the inherent correlations among users (or items). GLSCL treats users (or items) with their local batch of most similar users (or items) as positive contrastive pairs during training, which can capture the homogenous relationships in user–user and item–item similarity relationships while maintaining embedding uniformity. To validate the proposed model, extensive experiments were conducted on three real-world datasets, including Douban-Book, Yelp, and Amazon-Book. On the three datasets, our model outperforms the suboptimal model with an average improvement of 3.23%, 3.28%, 3.55%, and 3.41% in four metrics, respectively. Extensive ablation experiments and visual analyses were conducted, providing conclusive evidence for the effectiveness of the proposed core modules.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":"284 ","pages":"Article 127855"},"PeriodicalIF":7.5000,"publicationDate":"2025-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"GLSCL: Graph local similarity contrastive learning for recommendation\",\"authors\":\"Zhou Zhou,&nbsp;Zheng Hu,&nbsp;Shi-Min Cai,&nbsp;Tao Zhou\",\"doi\":\"10.1016/j.eswa.2025.127855\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Graph Contrastive Learning (GCL) has recently gained widespread adoption in recommendation systems owing to its outstanding performance and capability to alleviate data sparsity issues. GCL mitigates data sparsity issues by learning more uniformly distributed user and item representations. However, current recommendation approaches based on GCL have a significant drawback, which is to overlook the relationships between homogeneous nodes (i.e., users to users and items to items). The potential of contrastive learning in these contexts remains largely untapped because contrastive learning often focuses only on the user–item interaction space, missing the fine-grained, contextual similarities that exist within homogeneous nodes. These overlooked relationships can significantly improve recommendation accuracy by providing richer, more context-sensitive embeddings. To address this problem, we propose a Graph Local Similarity Contrastive Learning (GLSCL) framework, which enhances embedding uniformity and constructs contrast pairs based on local similarity. Specifically, to avoid the loss of original information, we employ a random perturbation contrastive task to enhance embedding uniformity and improve recommendation performance by exploring the inherent correlations among users (or items). GLSCL treats users (or items) with their local batch of most similar users (or items) as positive contrastive pairs during training, which can capture the homogenous relationships in user–user and item–item similarity relationships while maintaining embedding uniformity. To validate the proposed model, extensive experiments were conducted on three real-world datasets, including Douban-Book, Yelp, and Amazon-Book. On the three datasets, our model outperforms the suboptimal model with an average improvement of 3.23%, 3.28%, 3.55%, and 3.41% in four metrics, respectively. Extensive ablation experiments and visual analyses were conducted, providing conclusive evidence for the effectiveness of the proposed core modules.</div></div>\",\"PeriodicalId\":50461,\"journal\":{\"name\":\"Expert Systems with Applications\",\"volume\":\"284 \",\"pages\":\"Article 127855\"},\"PeriodicalIF\":7.5000,\"publicationDate\":\"2025-04-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Expert Systems with Applications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0957417425014770\",\"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":"Expert Systems with Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0957417425014770","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

图对比学习(GCL)由于其出色的性能和缓解数据稀疏性问题的能力,最近在推荐系统中得到了广泛的应用。GCL通过学习更统一分布的用户和项表示来减轻数据稀疏性问题。然而,目前基于GCL的推荐方法有一个明显的缺点,那就是忽略了同构节点之间的关系(即用户对用户和物品对物品)。在这些环境中,对比学习的潜力在很大程度上仍未得到开发,因为对比学习通常只关注用户-物品交互空间,而忽略了同质节点中存在的细粒度的上下文相似性。通过提供更丰富、更上下文敏感的嵌入,这些被忽视的关系可以显著提高推荐的准确性。为了解决这个问题,我们提出了一个图局部相似度对比学习(GLSCL)框架,该框架增强了嵌入一致性,并基于局部相似度构建了对比对。具体而言,为了避免原始信息的丢失,我们采用随机扰动对比任务,通过探索用户(或项目)之间的内在相关性来增强嵌入均匀性,提高推荐性能。GLSCL在训练过程中将用户(或物品)与其本地最相似的一批用户(或物品)作为正对比对,在保持嵌入一致性的同时捕获用户-用户和物品-物品相似关系中的同质关系。为了验证所提出的模型,在三个真实世界的数据集上进行了广泛的实验,包括豆瓣书、Yelp和亚马逊书。在这三个数据集上,我们的模型在四个指标上的平均改进分别为3.23%、3.28%、3.55%和3.41%,优于次优模型。进行了广泛的烧蚀实验和可视化分析,为所提出的核心模块的有效性提供了确凿的证据。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
GLSCL: Graph local similarity contrastive learning for recommendation
Graph Contrastive Learning (GCL) has recently gained widespread adoption in recommendation systems owing to its outstanding performance and capability to alleviate data sparsity issues. GCL mitigates data sparsity issues by learning more uniformly distributed user and item representations. However, current recommendation approaches based on GCL have a significant drawback, which is to overlook the relationships between homogeneous nodes (i.e., users to users and items to items). The potential of contrastive learning in these contexts remains largely untapped because contrastive learning often focuses only on the user–item interaction space, missing the fine-grained, contextual similarities that exist within homogeneous nodes. These overlooked relationships can significantly improve recommendation accuracy by providing richer, more context-sensitive embeddings. To address this problem, we propose a Graph Local Similarity Contrastive Learning (GLSCL) framework, which enhances embedding uniformity and constructs contrast pairs based on local similarity. Specifically, to avoid the loss of original information, we employ a random perturbation contrastive task to enhance embedding uniformity and improve recommendation performance by exploring the inherent correlations among users (or items). GLSCL treats users (or items) with their local batch of most similar users (or items) as positive contrastive pairs during training, which can capture the homogenous relationships in user–user and item–item similarity relationships while maintaining embedding uniformity. To validate the proposed model, extensive experiments were conducted on three real-world datasets, including Douban-Book, Yelp, and Amazon-Book. On the three datasets, our model outperforms the suboptimal model with an average improvement of 3.23%, 3.28%, 3.55%, and 3.41% in four metrics, respectively. Extensive ablation experiments and visual analyses were conducted, providing conclusive evidence for the effectiveness of the proposed core modules.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Expert Systems with Applications
Expert Systems with Applications 工程技术-工程:电子与电气
CiteScore
13.80
自引率
10.60%
发文量
2045
审稿时长
8.7 months
期刊介绍: Expert Systems With Applications is an international journal dedicated to the exchange of information on expert and intelligent systems used globally in industry, government, and universities. The journal emphasizes original papers covering the design, development, testing, implementation, and management of these systems, offering practical guidelines. It spans various sectors such as finance, engineering, marketing, law, project management, information management, medicine, and more. The journal also welcomes papers on multi-agent systems, knowledge management, neural networks, knowledge discovery, data mining, and other related areas, excluding applications to military/defense systems.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信