结合约束学习函数的自监督推荐模型

Wang Guang, Li Gang
{"title":"结合约束学习函数的自监督推荐模型","authors":"Wang Guang, Li Gang","doi":"10.1109/ISAIEE57420.2022.00116","DOIUrl":null,"url":null,"abstract":"Aiming at the problem of data deficency and cold start in recommendation algorithm, this paper propose a self-supervised recommendation model combined with constrastive learning function(CLSRec). The model completes self-supervised learning through two positive-and-negative case-based constrastive learning tasks clotfilling prediction and subsequence prediction. Firstly, the algorithm masks a individual item and subsequence of the user interaction respectively according to the corresponding task requirements, and then predicts the missing items through the encoding layer and the self-attention layer. During the process, the model automatically constructs the positive and negative examples of the prediction results, and completes the training according to the constrastive learning loss function corresponding to the task, so as to learn the correct semantic feature representation and space vector coding. Secondly, the model utilizes the trained upstream item coding for the downstream prediction. Finally, the model can obtain user-satisfactory recommended results. By comparison of experimental results on Beauty, Toys and LastFM, the CLSRec works better on multiple metrics.","PeriodicalId":345703,"journal":{"name":"2022 International Symposium on Advances in Informatics, Electronics and Education (ISAIEE)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Self-supervised Recommendation Model Combined with Constrastive Learning Function\",\"authors\":\"Wang Guang, Li Gang\",\"doi\":\"10.1109/ISAIEE57420.2022.00116\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Aiming at the problem of data deficency and cold start in recommendation algorithm, this paper propose a self-supervised recommendation model combined with constrastive learning function(CLSRec). The model completes self-supervised learning through two positive-and-negative case-based constrastive learning tasks clotfilling prediction and subsequence prediction. Firstly, the algorithm masks a individual item and subsequence of the user interaction respectively according to the corresponding task requirements, and then predicts the missing items through the encoding layer and the self-attention layer. During the process, the model automatically constructs the positive and negative examples of the prediction results, and completes the training according to the constrastive learning loss function corresponding to the task, so as to learn the correct semantic feature representation and space vector coding. Secondly, the model utilizes the trained upstream item coding for the downstream prediction. Finally, the model can obtain user-satisfactory recommended results. By comparison of experimental results on Beauty, Toys and LastFM, the CLSRec works better on multiple metrics.\",\"PeriodicalId\":345703,\"journal\":{\"name\":\"2022 International Symposium on Advances in Informatics, Electronics and Education (ISAIEE)\",\"volume\":\"55 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 International Symposium on Advances in Informatics, Electronics and Education (ISAIEE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISAIEE57420.2022.00116\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Symposium on Advances in Informatics, Electronics and Education (ISAIEE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISAIEE57420.2022.00116","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

针对推荐算法中存在的数据不足和冷启动问题,提出了一种结合约束学习函数的自监督推荐模型(CLSRec)。该模型通过基于正负案例的约束性学习任务clotfill预测和子序列预测来完成自监督学习。该算法首先根据用户交互的任务要求分别掩码单个项和子序列,然后通过编码层和自关注层预测缺失项。在此过程中,模型自动构造预测结果的正样例和负样例,并根据任务对应的约束学习损失函数完成训练,从而学习正确的语义特征表示和空间向量编码。其次,该模型利用训练好的上游项目编码进行下游预测。最后,该模型能够获得用户满意的推荐结果。通过对比Beauty、Toys和LastFM的实验结果,CLSRec在多个指标上表现更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Self-supervised Recommendation Model Combined with Constrastive Learning Function
Aiming at the problem of data deficency and cold start in recommendation algorithm, this paper propose a self-supervised recommendation model combined with constrastive learning function(CLSRec). The model completes self-supervised learning through two positive-and-negative case-based constrastive learning tasks clotfilling prediction and subsequence prediction. Firstly, the algorithm masks a individual item and subsequence of the user interaction respectively according to the corresponding task requirements, and then predicts the missing items through the encoding layer and the self-attention layer. During the process, the model automatically constructs the positive and negative examples of the prediction results, and completes the training according to the constrastive learning loss function corresponding to the task, so as to learn the correct semantic feature representation and space vector coding. Secondly, the model utilizes the trained upstream item coding for the downstream prediction. Finally, the model can obtain user-satisfactory recommended results. By comparison of experimental results on Beauty, Toys and LastFM, the CLSRec works better on multiple metrics.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信