Hybrid recommendations by content-aligned Bayesian personalized ranking

IF 1.4 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS
Ladislav Peška
{"title":"Hybrid recommendations by content-aligned Bayesian personalized ranking","authors":"Ladislav Peška","doi":"10.1080/13614568.2018.1489002","DOIUrl":null,"url":null,"abstract":"ABSTRACT In many application domains of recommender systems, content-based (CB) information are available for users, objects or both. CB information plays an important role in the process of recommendation, especially in cold-start scenarios, where the volume of feedback data is low. However, CB information may come from several, possibly external, sources varying in reliability, coverage or relevance to the recommending task. Therefore, each content source or attribute possess a different level of informativeness, which should be taken into consideration during the process of recommendation. In this paper, we propose a Content-Aligned Bayesian Personalized Ranking Matrix Factorization method (CABPR), extending Bayesian Personalized Ranking Matrix Factorization (BPR) by incorporating multiple sources of content information into the BPR’s optimization procedure. The working principle of CABPR is to calculate user-to-user and object-to-object similarity matrices based on the content information and penalize differences in latent factors of closely related users’ or objects’. CABPR further estimates relevance of similarity matrices as a part of the optimization procedure. CABPR method is a significant extension of a previously published BPR_MCA method, featuring additional variants of optimization criterion and improved optimization procedure. Four variants of CABPR were evaluated on two publicly available datasets: MovieLens 1M dataset, extended by data from IMDB, DBTropes and ZIP code statistics and LOD-RecSys dataset extended by the information available from DBPedia. Experiments shown that CABPR significantly improves over standard BPR as well as BPR_MCA method w.r.t. several cold-start scenarios.","PeriodicalId":54386,"journal":{"name":"New Review of Hypermedia and Multimedia","volume":null,"pages":null},"PeriodicalIF":1.4000,"publicationDate":"2018-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/13614568.2018.1489002","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"New Review of Hypermedia and Multimedia","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1080/13614568.2018.1489002","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 5

Abstract

ABSTRACT In many application domains of recommender systems, content-based (CB) information are available for users, objects or both. CB information plays an important role in the process of recommendation, especially in cold-start scenarios, where the volume of feedback data is low. However, CB information may come from several, possibly external, sources varying in reliability, coverage or relevance to the recommending task. Therefore, each content source or attribute possess a different level of informativeness, which should be taken into consideration during the process of recommendation. In this paper, we propose a Content-Aligned Bayesian Personalized Ranking Matrix Factorization method (CABPR), extending Bayesian Personalized Ranking Matrix Factorization (BPR) by incorporating multiple sources of content information into the BPR’s optimization procedure. The working principle of CABPR is to calculate user-to-user and object-to-object similarity matrices based on the content information and penalize differences in latent factors of closely related users’ or objects’. CABPR further estimates relevance of similarity matrices as a part of the optimization procedure. CABPR method is a significant extension of a previously published BPR_MCA method, featuring additional variants of optimization criterion and improved optimization procedure. Four variants of CABPR were evaluated on two publicly available datasets: MovieLens 1M dataset, extended by data from IMDB, DBTropes and ZIP code statistics and LOD-RecSys dataset extended by the information available from DBPedia. Experiments shown that CABPR significantly improves over standard BPR as well as BPR_MCA method w.r.t. several cold-start scenarios.
混合推荐内容对齐贝叶斯个性化排名
摘要在推荐系统的许多应用领域中,基于内容的信息可用于用户、对象或两者。CB信息在推荐过程中起着重要作用,尤其是在反馈数据量较低的冷启动场景中。然而,CB信息可能来自多个来源,可能是外部来源,其可靠性、覆盖范围或与推荐任务的相关性各不相同。因此,每个内容源或属性都具有不同程度的信息性,在推荐过程中应予以考虑。在本文中,我们提出了一种内容对齐的贝叶斯个性化排名矩阵因子分解方法(CABPR),通过将多个内容信息源纳入BPR的优化过程来扩展贝叶斯个性化排名列表因子分解(BPR)。CABPR的工作原理是基于内容信息计算用户到用户和对象到对象的相似性矩阵,并惩罚密切相关的用户或对象的潜在因素的差异。CABPR进一步估计相似性矩阵的相关性,作为优化过程的一部分。CABPR方法是先前发表的BPR_MCA方法的重要扩展,具有优化标准的附加变体和改进的优化过程。CABPR的四种变体在两个公开可用的数据集上进行了评估:MovieLens 1M数据集,由IMDB、DBTropes和邮政编码统计数据扩展,LOD RecSys数据集由DBPedia提供的信息扩展。实验表明,与标准BPR以及BPR_MCA方法相比,CABPR在几种冷启动情况下都有显著的改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
New Review of Hypermedia and Multimedia
New Review of Hypermedia and Multimedia COMPUTER SCIENCE, INFORMATION SYSTEMS-
CiteScore
3.40
自引率
0.00%
发文量
4
审稿时长
>12 weeks
期刊介绍: The New Review of Hypermedia and Multimedia (NRHM) is an interdisciplinary journal providing a focus for research covering practical and theoretical developments in hypermedia, hypertext, and interactive multimedia.
×
引用
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学术官方微信