帮助 关于我们

返回检索结果

基于自监督学习的去流行度偏差推荐方法
Self-Supervised Learning for Alleviating Popularity Bias in Recommender Systems

查看参考文献26篇

张帅 1,2   高旻 1,2 *   文俊浩 1,2   熊庆宇 1,2   唐旭 2  
文摘 近年来,随着推荐系统研究的不断深入,推荐系统的公平性受到越来越多关注.流行度偏差也即流行的物品比非流行的物品更容易被推荐,是影响其公平性的重要因素之一.流行度偏差对推荐系统的各利益相关者都有严重的影响,引起研究者的广泛关注.相关研究主要通过推荐结果重排或学习过程中融合正则化项提升非流行物品的曝光率,而非流行物品的交互数据极度稀疏成为研究的瓶颈.针对此问题,本文提出基于自监督学习的去流行度偏差推荐方法,解决两个难点:(1)准确学习交互数据极度稀疏的非流行物品的表征;(2)提升非流行物品曝光率的同时,兼顾不同用户对流行和非流行物品的偏好.具体地,从用户的角度,提出流行物品和非流行物品双视图的用户偏好学习方法,准确学习用户对流行和非流行物品的真实偏好;从物品的角度,采用自监督学习,利用互信息最大化捕获非流行物品与流行物品间的潜在关系,辅助提升非流行物品嵌入学习的准确性.最后,设计用户流行度偏好一致性、资格公平性等指标,并通过三个公开数据集的大量实验说明了本文方法在提升推荐性能的同时,能有效缓解流行度偏差问题并具有较强的通用性.
其他语种文摘 In recent years,with the development of recommender system,more and more attention has been paid to the fairness of recommender system.Popularity bias mens that popular items are more likely to be recommended than unpopular items,which is one of the important factors affecting its fairness.Popularity bias has a serious impact on all stakeholders in the recommendation system,which has aroused widespread concern of researchers.Related research mainly improves the exposure rate of unpopular items by the rearrangement of recommended results or the integration of regularization items in the learning process,but the extremely sparse interaction data of unpopular items becomes the bottleneck of research.To solve this problem,this paper proposes self-supervised learning for alleviating popularity bias (SSLAB) to deal with two difficulties:(1) accurately learning the representation of unpopular items with extremely sparse interactive data;(2) improving the exposure rate of unpopular items while taking into account the preferences of different users for popular and unpopular items.Specifically,from the perspective of users,this paper proposes a dual view user preference learning method for popular and unpopular items to accurately learn users'real preferences for popular and unpopular items;from the perspective of items,self-supervised learning is used to capture the potential relationship between unpopular items and popular items by maximizing mutual information to help improve the accuracy of unpopular items embedded learning.Finally,metrics such as user popularity preference consistency and qualification fairness are designed,and a large number of experiments on three open data sets show that the proposed method can effectively alleviate the popularity bias and has a strong scalability while improving the recommendation performance.
来源 电子学报 ,2022,50(10):2361-2371 【核心库】
DOI 10.12263/DZXB.20210443
关键词 推荐系统 ; 协同过滤 ; 公平性 ; 流行度偏差 ; 自监督学习
地址

1. 重庆大学, 信息物理社会可信服务计算教育部重点实验室, 重庆, 400044  

2. 重庆大学大数据与软件学院, 重庆, 400044

语种 中文
文献类型 研究性论文
ISSN 0372-2112
学科 自动化技术、计算机技术
基金 国家自然科学基金 ;  重庆市自然科学基金 ;  重庆大学中央高校基本科研业务费项目 ;  重庆市技术创新与应用发展专项重点项目 ;  重庆市留学人员创业创新支持计划
文献收藏号 CSCD:7318655

参考文献 共 26 共2页

1.  Abdollahpouri H. Popularity bias in ranking and recommendation. Proceedings of the 2019 AAAI/ACM Conference on AI, Ethics, and Society,2019:529-530 CSCD被引 1    
2.  Vargas S. Improving sales diversity by recommending users to items. Eighth ACM Conference on Recommender Systems,2014:145-152 CSCD被引 1    
3.  Mansoury M. Fair match: A graph-based approach for improving aggregate diversity in recommender systems. Proceedings of the 28th ACM Conference on User Modeling, Adaptation and Personalization,2020:154-162 CSCD被引 1    
4.  Abdollahpouri H. Managing popularity bias in recommender systems with personalized re-ranking. Proceedings of the Thirty-Second International Florida Artificial Intelligence Research Society Conference,2019:413-418 CSCD被引 1    
5.  Abdollahpouri H. Controlling popularity bias in learning-to-rank recommendation. Proceedings of the Eleventh ACM Conference on Recommender Systems,2017:42-46 CSCD被引 3    
6.  Wang X. Neural graph collaborative filtering. Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval,2019:165-174 CSCD被引 76    
7.  He X. LightGCN: Simplifying and powering graph convolution network for recommendation. Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval,2020:639-648 CSCD被引 33    
8.  陈聪. 基于隐式反馈数据的个性化游戏推荐. 电子学报,2018,46(11):2626-2632 CSCD被引 1    
9.  郭景峰. 直播电视推荐系统的评分预测算法研究. 电子学报,2020,48(9):1735-1740 CSCD被引 4    
10.  Rendle S. BPR: Bayesian personalized ranking from implicit feedback. Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence,2009:452-461 CSCD被引 32    
11.  Hjelm R. Learning deep representations by mutual information estimation and maximization. 7th International Conference on Learning Representations,2019:233-256 CSCD被引 1    
12.  Kong L. A mutual information maximization perspective of language representation learning. 8th International Conference on Learning Representations,2020:1167-1178 CSCD被引 1    
13.  Linsker R. Self-organization in a perceptual network. IEEE Computer,1988,21(3):105-117 CSCD被引 14    
14.  Carse J. Unsupervised rep-resentation learning from pathology images with multi-directional contrastive predictive coding. 18th IEEE International Symposium on Biomedical Imaging,2021:1254-1258 CSCD被引 1    
15.  Zhou K. S3-Rec: Self-supervised learning for sequential recommendation with mutual information maximization. The 29th ACM International Conference on Information and Knowledge Management,2020:1893-1902 CSCD被引 1    
16.  Ma J. Disentangled self-supervision in sequential recommenders. The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining,2020:483-491 CSCD被引 1    
17.  Park Y J. The long tail of recommender systems and how to leverage it. Proceedings of the 2008 ACM Conference on Recommender Systems,2008:11-18 CSCD被引 6    
18.  Abdollahpouri H. The unfairness of popularity bias in recommendation. Proceedings of the Workshop on Recommendation in Multi-Stakeholder Environments Co-Located with the 13th ACM Conference on Recommender Systems,2019:1257-1263 CSCD被引 1    
19.  Patro G. FairRec: Two-sided fairness for personalized recommendations in two-sided platforms. Proceedings of The Web Conference 2020,2020:1194-1204 CSCD被引 1    
20.  Vardasbi A. Cascade modelbased propensity estimation for counterfactual learning to rank. Proceedings of the 43rd International ACM SI-GIR Conference on Research and Development in Information Retrieval,2020:2089-2092 CSCD被引 1    
引证文献 1

1 雷钦岚 基于流行的推荐研究综述 计算机科学与探索,2024,18(5):1109-1134
CSCD被引 0 次

显示所有1篇文献

论文科学数据集
PlumX Metrics
相关文献

 作者相关
 关键词相关
 参考文献相关

版权所有 ©2008 中国科学院文献情报中心 制作维护:中国科学院文献情报中心
地址:北京中关村北四环西路33号 邮政编码:100190 联系电话:(010)82627496 E-mail:cscd@mail.las.ac.cn 京ICP备05002861号-4 | 京公网安备11010802043238号