个性化推荐:一种增强的混合协同过滤

Parivash Pirasteh, Mohamed-Rafik Bouguelia, K. C. Santosh
{"title":"个性化推荐:一种增强的混合协同过滤","authors":"Parivash Pirasteh,&nbsp;Mohamed-Rafik Bouguelia,&nbsp;K. C. Santosh","doi":"10.1007/s43674-021-00001-z","DOIUrl":null,"url":null,"abstract":"<div><p>Commonly used similarity-based algorithms in memory-based collaborative filtering may provide unreliable and misleading results. In a cold start situation, users may find the most similar neighbors by relying on an insufficient number of ratings, resulting in low-quality recommendations. Such poor recommendations can also result from similarity metrics as they are incapable of capturing similarities among uncommon items. For example, when identical items between two users are popular items, and both users rated them with high scores, their different preferences toward other items are hidden from similarity metrics. In this paper, we propose a method that estimates the final ratings based on a combination of multiple ratings supplied by various similarity measures. Our experiments show that this combination benefits from the diversity within similarities and offers high-quality personalized suggestions to the target user.</p></div>","PeriodicalId":72089,"journal":{"name":"Advances in computational intelligence","volume":"1 4","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s43674-021-00001-z","citationCount":"8","resultStr":"{\"title\":\"Personalized recommendation: an enhanced hybrid collaborative filtering\",\"authors\":\"Parivash Pirasteh,&nbsp;Mohamed-Rafik Bouguelia,&nbsp;K. C. Santosh\",\"doi\":\"10.1007/s43674-021-00001-z\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Commonly used similarity-based algorithms in memory-based collaborative filtering may provide unreliable and misleading results. In a cold start situation, users may find the most similar neighbors by relying on an insufficient number of ratings, resulting in low-quality recommendations. Such poor recommendations can also result from similarity metrics as they are incapable of capturing similarities among uncommon items. For example, when identical items between two users are popular items, and both users rated them with high scores, their different preferences toward other items are hidden from similarity metrics. In this paper, we propose a method that estimates the final ratings based on a combination of multiple ratings supplied by various similarity measures. Our experiments show that this combination benefits from the diversity within similarities and offers high-quality personalized suggestions to the target user.</p></div>\",\"PeriodicalId\":72089,\"journal\":{\"name\":\"Advances in computational intelligence\",\"volume\":\"1 4\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-05-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1007/s43674-021-00001-z\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Advances in computational intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s43674-021-00001-z\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in computational intelligence","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.1007/s43674-021-00001-z","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

基于记忆的协同过滤中常用的基于相似性的算法可能提供不可靠和误导性的结果。在冷启动的情况下,用户可能会因为评级数量不足而找到最相似的邻居,从而导致低质量的推荐。这种糟糕的推荐也可能是由相似性度量造成的,因为它们无法捕捉不常见项目之间的相似性。例如,当两个用户之间相同的项目是受欢迎的项目,并且两个用户都给它们打分很高时,他们对其他项目的不同偏好会从相似性度量中隐藏起来。在本文中,我们提出了一种基于各种相似性度量提供的多个评级的组合来估计最终评级的方法。我们的实验表明,这种组合得益于相似性中的多样性,并为目标用户提供了高质量的个性化建议。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Personalized recommendation: an enhanced hybrid collaborative filtering

Personalized recommendation: an enhanced hybrid collaborative filtering

Commonly used similarity-based algorithms in memory-based collaborative filtering may provide unreliable and misleading results. In a cold start situation, users may find the most similar neighbors by relying on an insufficient number of ratings, resulting in low-quality recommendations. Such poor recommendations can also result from similarity metrics as they are incapable of capturing similarities among uncommon items. For example, when identical items between two users are popular items, and both users rated them with high scores, their different preferences toward other items are hidden from similarity metrics. In this paper, we propose a method that estimates the final ratings based on a combination of multiple ratings supplied by various similarity measures. Our experiments show that this combination benefits from the diversity within similarities and offers high-quality personalized suggestions to the target user.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信