基于条件生成对抗网络的个性化推荐

Jing Wen, Bi-Yi Chen, Chang-Dong Wang, Zhihong Tian
{"title":"基于条件生成对抗网络的个性化推荐","authors":"Jing Wen, Bi-Yi Chen, Chang-Dong Wang, Zhihong Tian","doi":"10.1109/ICDM51629.2021.00084","DOIUrl":null,"url":null,"abstract":"Most of the existing methods define recommendation as regression or classification for user-item interactions and apply discriminative models. However, recommender systems suffer from interaction data sparsity and data noise problems in reality. Recent Generative Adversarial Network-based recommender systems have the potential to solve the aforementioned problems. The negative sampling methods use the generator to collect effective signals from a large amount of unlabeled data to alleviate the data sparsity problem, while they suffer from sparse rewards in the policy gradient training process. The vector reconstruction methods generate user-related vectors for data augmentation to enhance robustness, but they lead to redundant calculation and only take the user as a condition and ignore information conveyed by items. To alleviate the limitations of these methods, we propose a novel framework termed Personalized Recommendation with Conditional Generative Adversarial Networks (PRGAN) to consider both the user and the item subset as conditions and formulate conditional rating vector generation as a user-item matching problem. The sparsity of conditional rating vectors can be controlled in our method, which simplifies the discriminator’s learning task. Experiments are conducted on four datasets to evaluate the effectiveness of the proposed framework.","PeriodicalId":320970,"journal":{"name":"2021 IEEE International Conference on Data Mining (ICDM)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"PRGAN: Personalized Recommendation with Conditional Generative Adversarial Networks\",\"authors\":\"Jing Wen, Bi-Yi Chen, Chang-Dong Wang, Zhihong Tian\",\"doi\":\"10.1109/ICDM51629.2021.00084\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Most of the existing methods define recommendation as regression or classification for user-item interactions and apply discriminative models. However, recommender systems suffer from interaction data sparsity and data noise problems in reality. Recent Generative Adversarial Network-based recommender systems have the potential to solve the aforementioned problems. The negative sampling methods use the generator to collect effective signals from a large amount of unlabeled data to alleviate the data sparsity problem, while they suffer from sparse rewards in the policy gradient training process. The vector reconstruction methods generate user-related vectors for data augmentation to enhance robustness, but they lead to redundant calculation and only take the user as a condition and ignore information conveyed by items. To alleviate the limitations of these methods, we propose a novel framework termed Personalized Recommendation with Conditional Generative Adversarial Networks (PRGAN) to consider both the user and the item subset as conditions and formulate conditional rating vector generation as a user-item matching problem. The sparsity of conditional rating vectors can be controlled in our method, which simplifies the discriminator’s learning task. Experiments are conducted on four datasets to evaluate the effectiveness of the proposed framework.\",\"PeriodicalId\":320970,\"journal\":{\"name\":\"2021 IEEE International Conference on Data Mining (ICDM)\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE International Conference on Data Mining (ICDM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDM51629.2021.00084\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Data Mining (ICDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDM51629.2021.00084","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

现有的推荐方法大多将推荐定义为用户-项目交互的回归或分类,并采用判别模型。然而,现实中推荐系统存在交互数据稀疏和数据噪声问题。最近基于生成对抗网络的推荐系统有可能解决上述问题。负抽样方法利用生成器从大量未标记数据中收集有效信号,缓解了数据稀疏性问题,但在策略梯度训练过程中受到稀疏奖励的影响。向量重建方法生成与用户相关的向量进行数据增强,增强鲁棒性,但存在冗余计算,且只以用户为条件,忽略了项目所传递的信息。为了减轻这些方法的局限性,我们提出了一种新的框架,即基于条件生成对抗网络(PRGAN)的个性化推荐,该框架将用户和项目子集作为条件,并将条件评级向量生成作为用户-项目匹配问题。该方法可以控制条件评价向量的稀疏性,简化了判别器的学习任务。在四个数据集上进行了实验,以评估所提出框架的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
PRGAN: Personalized Recommendation with Conditional Generative Adversarial Networks
Most of the existing methods define recommendation as regression or classification for user-item interactions and apply discriminative models. However, recommender systems suffer from interaction data sparsity and data noise problems in reality. Recent Generative Adversarial Network-based recommender systems have the potential to solve the aforementioned problems. The negative sampling methods use the generator to collect effective signals from a large amount of unlabeled data to alleviate the data sparsity problem, while they suffer from sparse rewards in the policy gradient training process. The vector reconstruction methods generate user-related vectors for data augmentation to enhance robustness, but they lead to redundant calculation and only take the user as a condition and ignore information conveyed by items. To alleviate the limitations of these methods, we propose a novel framework termed Personalized Recommendation with Conditional Generative Adversarial Networks (PRGAN) to consider both the user and the item subset as conditions and formulate conditional rating vector generation as a user-item matching problem. The sparsity of conditional rating vectors can be controlled in our method, which simplifies the discriminator’s learning task. Experiments are conducted on four datasets to evaluate the effectiveness of the proposed framework.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信