Effective Similarity Measures of Collaborative Filtering Recommendations Based on User Ratings Habits

Hongtao Liu, Lulu Guo, Long Chen, Xueyan Liu, Zhenjia Zhu
{"title":"Effective Similarity Measures of Collaborative Filtering Recommendations Based on User Ratings Habits","authors":"Hongtao Liu, Lulu Guo, Long Chen, Xueyan Liu, Zhenjia Zhu","doi":"10.1109/SKG.2018.00026","DOIUrl":null,"url":null,"abstract":"The core of the recommendation system is the recommendation algorithm, especially the application of collaborative filtering recommendation algorithm is the most widely used. With the rapid increase of data sparsity. This paper aims at the problem of data sparsity in collaborative filtering algorithms. By mining the hidden information behind the user and the project, that is, considering different factors in the user's personal rating habits, and using Cosine and Jaccard to calculate the full degree of similarity to effectively use the rate data, improves the similarity calculation method, and solves the problem of low accuracy of the recommendation due to inaccuracy of similarity calculation. This is more in line with the logic of real life and can produce reasonable recommendations.","PeriodicalId":265760,"journal":{"name":"2018 14th International Conference on Semantics, Knowledge and Grids (SKG)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 14th International Conference on Semantics, Knowledge and Grids (SKG)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SKG.2018.00026","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

The core of the recommendation system is the recommendation algorithm, especially the application of collaborative filtering recommendation algorithm is the most widely used. With the rapid increase of data sparsity. This paper aims at the problem of data sparsity in collaborative filtering algorithms. By mining the hidden information behind the user and the project, that is, considering different factors in the user's personal rating habits, and using Cosine and Jaccard to calculate the full degree of similarity to effectively use the rate data, improves the similarity calculation method, and solves the problem of low accuracy of the recommendation due to inaccuracy of similarity calculation. This is more in line with the logic of real life and can produce reasonable recommendations.
基于用户评分习惯的协同过滤推荐的有效相似性度量
推荐系统的核心是推荐算法,尤其是协同过滤推荐算法的应用最为广泛。随着数据稀疏度的迅速提高。本文主要研究协同过滤算法中的数据稀疏性问题。通过挖掘用户和项目背后隐藏的信息,即考虑用户个人评分习惯中的不同因素,利用余弦法和Jaccard法计算相似度全度,有效利用率数据,改进了相似度计算方法,解决了由于相似度计算不准确导致推荐准确率低的问题。这样更符合现实生活的逻辑,能够产生合理的建议。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信