Efficient and Bias-aware Recommendation with Two-side Relevance for Implicit Feedback

Guanyu Lin, Lei Huang, Yuting Yin, Chengmin Zhang, Feng Zhu, Lingqi Kong, Zhiheng Li
{"title":"Efficient and Bias-aware Recommendation with Two-side Relevance for Implicit Feedback","authors":"Guanyu Lin, Lei Huang, Yuting Yin, Chengmin Zhang, Feng Zhu, Lingqi Kong, Zhiheng Li","doi":"10.1109/PRML52754.2021.9520701","DOIUrl":null,"url":null,"abstract":"Today’s wide-spread recommendation is usually constructed based on implicit data such as click for easy collection but whether the no clicked data is negative feedback or unobserved positive feedback confuses the model construction. As a response, Relevance Matrix Factorization (Rel-MF) is recently proposed to tackle this problem as well as the missing-not-at-random (MNAR) problem ignored by previous studies. However, Rel-MF meets three problems: limited assumption (LA), negative square loss (NSL) and indiscriminate no click data (INCD). In this paper, we first get rid of Rel-MF’s limited assumption and establish a more general theory by incorporating a defined transformation function which captures the relevance level to our two-side relevance ideal loss, containing Rel-MF’s theory. To resolve the INCD problem and NSL problem, we introduce an adjusting variable and perform normalization, respectively, which is called Naive Solution with Normalization for Rel-MF (NRel-MF). But we then analytically discover that the clipped function proposed by Rel-MF meets the high variance problem. To overcome it, we design a power clipped function and further propose Improved Solution with Power Function for Rel-MF (PRel-MF). Besides, we also explore propensity score estimation from user and hybrid perspectives in contrast to Rel-MF’s sole item perspective. Finally, we also consider and address the computational problem caused by the Rel-MF’s non-sampling strategy. Empirical results verify the effectiveness of our solutions from both performance even in rare items and loss decrease. In broader perspective experiment, decent performance is seen in item perspective with fewer recommended items while in user perspective with more recommended items and hybrid perspective outperforms them in more situations.","PeriodicalId":429603,"journal":{"name":"2021 IEEE 2nd International Conference on Pattern Recognition and Machine Learning (PRML)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 2nd International Conference on Pattern Recognition and Machine Learning (PRML)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PRML52754.2021.9520701","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Today’s wide-spread recommendation is usually constructed based on implicit data such as click for easy collection but whether the no clicked data is negative feedback or unobserved positive feedback confuses the model construction. As a response, Relevance Matrix Factorization (Rel-MF) is recently proposed to tackle this problem as well as the missing-not-at-random (MNAR) problem ignored by previous studies. However, Rel-MF meets three problems: limited assumption (LA), negative square loss (NSL) and indiscriminate no click data (INCD). In this paper, we first get rid of Rel-MF’s limited assumption and establish a more general theory by incorporating a defined transformation function which captures the relevance level to our two-side relevance ideal loss, containing Rel-MF’s theory. To resolve the INCD problem and NSL problem, we introduce an adjusting variable and perform normalization, respectively, which is called Naive Solution with Normalization for Rel-MF (NRel-MF). But we then analytically discover that the clipped function proposed by Rel-MF meets the high variance problem. To overcome it, we design a power clipped function and further propose Improved Solution with Power Function for Rel-MF (PRel-MF). Besides, we also explore propensity score estimation from user and hybrid perspectives in contrast to Rel-MF’s sole item perspective. Finally, we also consider and address the computational problem caused by the Rel-MF’s non-sampling strategy. Empirical results verify the effectiveness of our solutions from both performance even in rare items and loss decrease. In broader perspective experiment, decent performance is seen in item perspective with fewer recommended items while in user perspective with more recommended items and hybrid perspective outperforms them in more situations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于隐性反馈的双向关联的高效、偏见感知推荐
目前广泛传播的推荐通常是基于点击等隐式数据构建的,便于收集,但未点击的数据是负反馈还是未观察到的正反馈,使模型构建变得混乱。为了解决这一问题,相关矩阵分解(Rel-MF)以及之前研究忽略的缺失非随机(MNAR)问题最近被提出。然而,Rel-MF存在三个问题:有限假设(LA)、负平方损失(NSL)和无点击数据(INCD)。在本文中,我们首先摆脱了Rel-MF的有限假设,并通过包含Rel-MF理论的定义转换函数建立了一个更一般的理论,该转换函数捕获了我们的双边相关理想损失的相关水平。为了解决INCD问题和NSL问题,我们分别引入了一个调节变量并进行了归一化处理,称为正则化朴素解(NRel-MF)。但我们分析发现,由Rel-MF提出的裁剪函数满足高方差问题。为了克服这个问题,我们设计了一个功率截断函数,并进一步提出了基于功率函数的Rel-MF (PRel-MF)改进方案。此外,我们还探讨了从用户和混合的角度来估计倾向得分,而不是从Rel-MF的单一项目角度。最后,我们还考虑并解决了Rel-MF的非采样策略带来的计算问题。实证结果从稀有物品的性能和减少损失两方面验证了我们的解决方案的有效性。在宽视角实验中,项目视角在推荐项目较少的情况下表现良好,而用户视角在推荐项目较多的情况下表现较好,混合视角在更多情况下表现较好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Intelligent Robot for Cleaning Garbage Based on OpenCV Research on Tibetan-Chinese Machine Translation Based on Multi-Strategy Processing A Survey of Object Detection Based on CNN and Transformer A Review of Segmentation and Classification for Retinal Optical Coherence Tomography Images Research on the Methods of Speech Synthesis Technology
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1