Improved Collaborative Filtering Recommendation via Non-Commonly-Rated Items

Weijie Cheng, Guisheng Yin, Yuxin Dong, Hongbin Dong, Wansong Zhang
{"title":"Improved Collaborative Filtering Recommendation via Non-Commonly-Rated Items","authors":"Weijie Cheng, Guisheng Yin, Yuxin Dong, Hongbin Dong, Wansong Zhang","doi":"10.1109/ICICSE.2015.20","DOIUrl":null,"url":null,"abstract":"Collaborative filtering (CF) in recommendation systems has made great success in making automatic score predictions by using users' ratings on commonly-rated items. However, due to data sparsity and cold starting, in real systems, common-rated items among users are often not sufficient for accurate recommendations when using CF. Besides, the implicit relationships between users contained in huge amount of non-commonly-rated items are rarely utilized. In this paper, a new CF recommendation taking users' implicit relationships hidden in users' ratings on non-commonly rated items into consideration is proposed. In this method, we provide an algorithm to infer users' preferences for their non-commonly rated items and then based on these preferences. We obtain users' similarities on their non-commonly rated items. With a dynamic adjusting weight adapted to non-commonly rated items' proportion in two users' all rated items, we combine the similarities with traditional similarities based on co-rated items. Experiments are conducted on the MovieLens dataset for comparing the proposed approach with the traditional user-based collaborative filtering algorithm. The results show that our approach improves the recommendation accuracy.","PeriodicalId":159836,"journal":{"name":"2015 Eighth International Conference on Internet Computing for Science and Engineering (ICICSE)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Eighth International Conference on Internet Computing for Science and Engineering (ICICSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICSE.2015.20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Collaborative filtering (CF) in recommendation systems has made great success in making automatic score predictions by using users' ratings on commonly-rated items. However, due to data sparsity and cold starting, in real systems, common-rated items among users are often not sufficient for accurate recommendations when using CF. Besides, the implicit relationships between users contained in huge amount of non-commonly-rated items are rarely utilized. In this paper, a new CF recommendation taking users' implicit relationships hidden in users' ratings on non-commonly rated items into consideration is proposed. In this method, we provide an algorithm to infer users' preferences for their non-commonly rated items and then based on these preferences. We obtain users' similarities on their non-commonly rated items. With a dynamic adjusting weight adapted to non-commonly rated items' proportion in two users' all rated items, we combine the similarities with traditional similarities based on co-rated items. Experiments are conducted on the MovieLens dataset for comparing the proposed approach with the traditional user-based collaborative filtering algorithm. The results show that our approach improves the recommendation accuracy.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
改进的协同过滤推荐通过非共同评级的项目
推荐系统中的协同过滤(CF)通过使用用户对常用评分项目的评分进行自动评分预测,取得了巨大的成功。然而,由于数据稀疏性和冷启动的原因,在实际系统中,使用CF时,用户之间的共同评价项目往往不足以进行准确的推荐,而且大量非共同评价项目中包含的用户之间的隐含关系很少被利用。本文提出了一种新的CF推荐方法,该方法考虑了用户对非常用评分项目的评分中隐藏的用户隐式关系。在这种方法中,我们提供了一种算法来推断用户对他们的非通常评价项目的偏好,然后基于这些偏好。我们获得了用户在非常用评价项目上的相似度。采用一种动态调整权重,以适应非共同评价项目在两名用户所有评价项目中所占的比例,将基于共同评价项目的相似度与传统相似度相结合。在MovieLens数据集上进行了实验,将该方法与传统的基于用户的协同过滤算法进行了比较。结果表明,我们的方法提高了推荐的准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Measurement of Text Emotion Complexity in Micro-blog The Modified HR Calculus to Reproducing Kernel Hilbert Space and the Quaternion Kernel Least Mean Square Algorithm Improved Collaborative Filtering Recommendation via Non-Commonly-Rated Items A Review of Uncertain Data Stream Clustering Algorithms A QoS Aware Routing for Intermittently Connected Mobile Networks
×
引用
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